Abstract
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).
Publisher
Darcy & Roy Press Co. Ltd.
Reference17 articles.
1. 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.
2. Z. Paul, “Factorization of RSA-250,” 2020. [Online]. Available: https://lists.gforge.inria.fr/pipermail/cado-nfs-discuss/2020-February/001166.html.
3. 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.
4. 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.
5. D. Boneh, “Twenty Years of Attacks on the RSA Cryptosystem,” Not. AMS, vol. 46, Feb. 2002.
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献