Volume 20 No 12 (2022)
 Download PDF
A Review of the Applications of Number Theory in RSA Cryptosystem
Argha Sengupta, Nikita Madaan, Shikha Tuteja
This paper is a review of prime numbers and their applications in cryptography, discussed in special reference to RSA (Rivest-Shamir-Adleman) cryptosystem. Firstly, we discuss prime numbers and important related theorems, viz. Unique Factorization Theorem and Chinese Remainder Theorem. Then we discuss modular arithmetic and introduce Euler's totient function and discuss Euler's theorem, which forms the backbone of RSA cryptosystem. Next, Cryptography and public key cryptography are introduced and the implementation of RSA cryptosystem is discussed. RSA is widely used because of the difficulty of finding the prime factorization of large composite numbers. Implementation of RSA cryptosystem in real-world applications is also discussed along with the conclusions.
Prime Numbers, Modular Arithmetic, Public-Key Cryptography, RSA Cryptosystem
Copyright © Neuroquantology

Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.

Articles published in the Neuroquantology are available under Creative Commons Attribution Non-Commercial No Derivatives Licence (CC BY-NC-ND 4.0). Authors retain copyright in their work and grant IJECSE right of first publication under CC BY-NC-ND 4.0. Users have the right to read, download, copy, distribute, print, search, or link to the full texts of articles in this journal, and to use them for any other lawful purpose.