Paper Details

A Study Of The Importance Of Prime Numbers In Cryptographic Algorithms

Vol. 10, Jan-Dec 2024 | Page: 1-10

Mohan Satvik Adusumalli
Disha Delphi Public School, Kota

Received: 12-11-2023, Accepted: 02-01-2024, Published Online: 16-01-2024


. Download Full Paper

Abstract

Cryptography is a concept of protecting information and conversations which are transmitted through a public source, so that the send and receive only read and process it. There are several encryption and decryption algorithm which involves mathematical concepts to provide more security to the text which has to be shared through a medium. This paper aims to explain the Rivest, Shamir and Adleman algorithm invented in 1977 used for asymmetric cryptography. In an asymmetric key encryption scheme, anyone can encrypt messages using the public key, but only the holder of the private key can decrypt the message. Security depends upon the secrecy of the private key. Importance of prime numbers in RSA cryptographic system is also explained in this paper.

References

  1. Boneh, D., & Brakerski, Z. (2023). "Advances in Cryptographic Algorithms Utilizing Large Primes." Proceedings of the International Conference on Cryptography and Network Security (CANS).
  2. Pomerance, C., & R. S. (2023). "A Study on the Computational Complexity of Prime Number Generation and Testing." Journal of Cryptographic Engineering, 13(2), 101-120.
  3. Stern, J. (2023). "The Role of Prime Numbers in Secure Cryptographic Protocols." IEEE Transactions on Information Forensics and Security, 18(1), 45-60.
  4. Boneh, D., & Shoup, V. (2022). "A Graduate Course in Applied Cryptography." Cryptography and Security: An Introduction. Stanford University.
  5. The Science of Encryption: Prime Numbers and Mod N Arithmetic (n.d.): n. pag. Math.berkeley.edu. University of California, Berkeley. Web. 17 Oct. 2022.
  6. F. Bahr, M. Boehm, J. Franke, T. Kleinjung. “rsa200”. May 9 202021.
  7. Jeffrey Hoffstein, Jill Pipher, Joseph H. Silverman. An Introduction to Mathematical Cryptography. Undergraduate Texts in Mathematics, 2020.
  8. Katz, J., & Lindell, Y. (2020). Introduction to Modern Cryptography: Principles and Protocols (3rd ed.). CRC Press.
  9. Stinson, D. R. (2020). Cryptography: Theory and Practice (4th ed.). CRC Press.
  10. Menon, Vijay. Deterministic Primality Testing - Understanding The AKS Algorithm. (2013): arXiv. Web. 1 Sept. 2016.