Cryptography: RSA Algorithm
Keywords:
cryptography, modular arithmetic, greatest common divisor, Euclidean Algorithm, Bézout's Lemma, Euler’s Totient Function, RSAAbstract
Our world is becoming more interconnected through technology, with some notable examples being social media and online payment services. With this higher connection comes the increased risk of information, ranging from harmless text messages to credit card information, being stolen. These risks make cryptography, the field regarding the securing of messages, vital in order to minimize the chance of these data breaches. Essentially, this field is about creating, improving, and implementing various algorithms to encrypt and decrypt messages so only the sender and receiver can see the messages. This paper reviews one such algorithm, the RSA algorithm, and the mathematical concepts behind it.
References or Bibliography
Fermat’s Little Theorem and Euler’s Theorem. (n.d.). [Handout]. Art of Problem Solving.
Keef, P., & Guichard, D. (n.d.). 3.3 The Euclidean Algorithm. Introduction to Higher Mathematics. Retrieved July 1, 2022, from https://www.whitman.edu/mathematics/higher_math_online/section03.03.html.
Modular arithmetic. (2010). In A. Nayak (Ed.), Discrete Mathematics. U. Waterloo. https://www.math.uwaterloo.ca/~anayak/courses/ece103-s10/notes/modular-arithmetic.pdf.
Silverman, J. H. (2013). A Friendly Introduction to Number Theory. India: Pearson.
Simmons, G. (2022, August 2). cryptology | Definition, Examples, History, & Facts. Encyclopedia Britannica. https://www.britannica.com/topic/cryptology/History-of-cryptology.
Downloads
Posted
Categories
License
Copyright (c) 2023 Rayan Das, Dr. Goldsztein
This work is licensed under a Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.
The copyright holder(s) for this article has granted JSR.org a license to display the article in perpetuity.
