Applications of Modular Arithmetic and Recursion to the RSA Cipher
1Millard North High School, Omaha, Nebraska, United States.
Abstract: Regarding cryptography, one of the most popular forms of encoding information today is the RSA Cipher, used to convert one integer into another. The workings of the RSA Cipher can be described through the lens of modular arithmetic, a branch of number theory focused on remainders when dividing positive integers. This paper will explain the mathematics of the RSA Cipher, methods of decryption, and justifications as to why it is such an effective tool for encoding data.
Keywords: Modular Arithmetic, Euclidean Algorithm, Recursion, RSA Cipher.
Cite this article as: Eshaan Giri, Applications of Modular Arithmetic and Recursion to the RSA Cipher, Int. J. Math. And Appl., vol. 9, no. 3, 2021, pp. 61-66.References
- Neal Koblitz, A course in number theory and cryptography, Volume 114, Springer Science \& Business Media, (1994).
- Douglas Robert Stinson and Maura Paterson, Cryptography: theory and practice, CRC press, (2018).