An Overview of RSA and OAEP Padding
DOI:
https://doi.org/10.54097/hset.v1i.431Keywords:
RSA, OAEP, Encryption, CryptosystemAbstract
Encryption is crucial in information communication. The secret data is transformed into secure form and transferred through various channels. It is important for encryption to prevent unauthorized access to data and the encrypted data can’t be cracked easily. The RSA algorithm was released by Rivest, Shamir and Adleman in 1978. It was the first practical asymmetric cryptosystem and now it is the most widely used asymmetric cryptosystem in the world, covering security of almost everything such as cellphone communication to online banking. In this article, we review the RSA algorithm and the padding schemes used with RSA encryption to avoid semantical insecurity such as optimal asymmetric encryption padding (OSAP).
Downloads
References
R. Rivest, A. Shamir, and L. Adleman, “A Method for Obtaining Digital Signatures and Public-Key Cryptosystems,” Commun. ACM, vol. 26, pp. 96–99, Jan. 1983, doi: 10.1145/359340.359342.
Z. Paul, “Factorization of RSA-250,” 2020. [Online]. Available: https://lists.gforge.inria.fr/pipermail/cado-nfs-discuss/2020-February/001166.html.
S. Goldwasser and S. Micali, “Probabilistic Encryption & How to Play Mental Poker Keeping Secret All Partial Information,” in Proceedings of the Fourteenth Annual ACM Symposium on Theory of Computing, 1982, pp. 365–377, doi: 10.1145/800070.802212.
W. Diffie and M. Hellman, “New directions in croptography,” Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 22, p. 159, 1976, doi: 10.1007/3-540-44709-1_14.
D. Boneh, “Twenty Years of Attacks on the RSA Cryptosystem,” Not. AMS, vol. 46, Feb. 2002.
W. Contributors, “RSA (cryptosystem),” Wikipedia, The Free Encyclopedia., 2021. https://en.wikipedia.org/w/index.php?title=RSA_(cryptosystem)&oldid=1033804079 (accessed Sep. 01, 2021).
W. Contributors, “Padding (cryptography),” Wikipedia, The Free Encyclopedia., 2021. https://en.wikipedia.org/w/index.php?title=Padding_(cryptography)&oldid=1037259171.
D. Boneh, “Simplified OAEP for the RSA and rabin functions,” Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 2139 LNCS, pp. 275–291, 2001, doi: 10.1007/3-540-44647-8_17.
M. Bellare and P. Rogaway, “Optimal asymmetric encryption,” Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 950, pp. 92–111, 1995, doi: 10.1007/bfb0053428.
D. B. Johnson and S. M. Matyas, “Asymmetric encryption: Evolution and enhancements,” CryptoBytes, vol. 2, no. 1, p. 3, 1996, [Online]. Available: https://iu.edu.jo/files/FacultyIT/Computer-Science/Courses/IT Security/stalling Computer security PP slides/Papers/AsymmetricEncryption.pdf.
Wikipedia contributors, “PKCS 1,” Wikipedia, The Free Encyclopedia., 2021. https://en.wikipedia.org/w/index.php?title=PKCS_1&oldid=1026886353 (accessed Sep. 01, 2021).
R. S. A. Laboratories, R. S. A. Security, and C. D. Bedford, “RSAES-OAEP Encryption Scheme.” RSA Lab, 2013.
Wikipedia contributors, “Optimal asymmetric encryption padding,” Wikipedia, The Free Encyclopedia. https://en.wikipedia.org/w/index.php?title=Optimal_asymmetric_encryption_padding&oldid=1041789929 (accessed Sep. 03, 2021).
S. Goldwasser and S. Micali, “Probabilistic encryption,” J. Comput. Syst. Sci., vol. 28, no. 2, pp. 270–299, 1984, doi: https://doi.org/10.1016/0022-0000(84)90070-9.
C. Rackoff and D. R. Simon, “Non-interactive zero-knowledge proof of knowledge and chosen ciphertext attack,” Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 576 LNCS, pp. 433–444, 1992, doi: 10.1007/3-540-46766-1_35.
V. Shoup, “OAEP Reconsidered,” J. Cryptol., vol. 15, no. 4, pp. 223–249, 2002, doi: 10.1007/s00145-002-0133-9.
E. Fujisaki, T. Okamoto, D. Pointcheval, and J. Stern, “RSA-OAEP is secure under the RSA Assumption,” Lect. Notes Comput. Sci. (including Subser. Lect. Notes Artif. Intell. Lect. Notes Bioinformatics), vol. 2139 LNCS, pp. 260–274, 2001, doi: 10.1007/3-540-44647-8_16.
Downloads
Published
Conference Proceedings Volume
Section
License
This work is licensed under a Creative Commons Attribution-NonCommercial 4.0 International License.
How to Cite
