RSA Cryptosystem

I. Introduction
A. RSA Cryptosystem is a sophisticated method of encryption that utilizes two large prime numbers as the basis for the public key (Gandhi et al., 2022).
B. The proposed paper will discuss the central elements of this method of encryption. It will be argued that despite having been around since the late 1970s, RSA Cryptosystem remains a powerful and effective method for the encryption and decryption of sensitive messages (“What Is,” n.d.).
II. Genesis of the Method
A. The acronym “RSA” is taken from the first letters of the surnames of its three principal creators: Ron Rivest, Adi Shamir, and Leonard Adelman of the Massachusetts Institute of Technology (“What Is,” n.d.).
B. The fundamentals of the method were in place by 1977 (“What Is,” n.d.).
III. Key Elements of the Method
A. RSA is a method of asymmetric encryption, meaning that there are distinct keys used for encryption and decryption (Lake, 2021).
B. The method begins by selecting two large prime numbers. Security will be most effective if the numbers are randomly chosen and if they are far apart in terms of cardinality (Lake, 2021).
C. The two numbers are then used to create the public and private keys for the method, which are generated using a series of complex mathematical transformations utilizing Carmichael’s totient function (Lake, 2021).

1. Messages are encrypted using the public key of the method. They can only be decrypted by someone who possesses the private key (Mok & Chuah, 2019).
2. In brief: The two parties set up their key pairs using the two large prime numbers (together with a number of transformations of these numbers) and share the public key with one another. The first then uses their private key to encrypt the message, and the second uses their private key to decrypt the message. Obviously, the key point is that no one who lacks the private key for this instantiation of the method can decrypt the messages (Mok & Chuah, 2019).
   IV. Conclusion
   A. RSA Cryptosystem is an effective way to encrypt and decrypt sensitive messages. It is one of the most effective ways ever devised to do these things (Nitaj et al., 2022).
   B. It is nearly impossible to grasp the nature of the process completely without considerable mathematical sophistication; hence, the paper attempts to simplify the key ideas without interrupting the actual nature of the process (Nitaj et al., 2022).  
   References
   Gandhi, T., Navlakha, M., Raheja, R., Mehta, V., Jhaveri, Y., & Shekokar, N. (2022, December 2-3). Enhanced RSA cryptosystem: A secure and nimble approach. 2022 5th International Conference on Advances in Science and Technology (ICAST), Mumbai, India. https://ieeexplore.ieee.org/document/10039627
   Lake, J. (2021, March 18). What is RSA encryption and how does it work? Comparitech. https://www.comparitech.com/blog/information-security/rsa-encryption/
   Mok, C., & Chuah, C. (2019). An intelligence brute force attack on RSA cryptosystem. Communications in Computational and Applied Mathematics, 1(1), 1-7. https://fazpublishing.com/ccam/index.php/ccam/article/view/6/1
   Nitaj, A., Ariffin, M., Adenan, N., Lau, T., & Chen, J. (2022). Security issues of novel RSA variant. IEEE Access, 10. https://doi.org/10.1109/ACCESS.2022.3175519
   What is the RSA algorithm? (n.d.). Educative. Retrieved June 30, 2023, from https://www.educative.io/answers/what-is-the-rsa-algorithm