Paper on RSA- History, Methodology, and Usage
In a cryptosystem, RSA algorithm forms the foundation. RSA is the abbreviated form of Rivest-Shamir-Adleman, and it is a suite consisting of cryptographic algorithms. Ron Rivest, Leonard Adleman, and Adi Shamir first publicly used the RSA in 1977 (Goshwe, 2013). They were from the Massachusetts Institute of Technology. They founded the RSA Data Security in the year 1982. In order to find Digital Certificates International, alternatively known as the VeriSign, RSA sent people in 1995. The basis of the RSA algorithm is that one single way of factoring a large number does not exist. It is necessary to have an additional amount of processing time and power to factor huge numbers.
The RSA functions after using the prime factorization trapdoor as well as the “Diffie-Hellman Key Exchange” so that asymmetric encryption can be achieved. The difficulty level of prime factorization is high, and therefore, RSA is completely reliant on it (Zhou & Tang, 2011). It is a security method, and it mainly involves four steps. These are the Key Generation, Key Distribution, Encryption, and Decryption. In the case of Key Generation, the user can use any random number or even select 2 prime numbers (q and p). It is vital to keep these numbers secret. Now, the user can compute n=pq. Here n refers to the modulus in case of private and public keys. Considering the case of Key Distribution, it should be noted that when B wants to send A any secret information, B should know the public key of A so that it can encrypt the entire message. Similarly, A should know the private key in order to decrypt the message. A never share the private key with anyone. The third step involves Encryption. It implies that after obtaining the public key of A, it is easier for B to send the message to A. However, the message should be converted to an integer by using a common padding scheme. The last step includes Decryption. Here, A can recuperate the message from the ciphertext with the help of a private key. Thereafter, it would be possible to recover the actual message after alternating the padding scheme.
RSA can be used in the case of digital signatures and encryption schemes. Earlier, it was used in order to encrypt symmetric key so that it can be sent to the second party upon their request. It is impossible to use RSA to encrypt an entire file because it is slow in comparison to other methods of encryption. In the case of Digital Signatures, the user can use the private key in order to sign a file or message (Milanov, 2009). In case the second party possesses the public key, it would be possible to verify the authenticity of the file and test whether; the file has been damaged or altered. Again, it would be possible to develop non-repudiation schemes by using a similar logic. Hence, RSA is useful for authenticating the sender.
Brief message using Caesar Cypher
g yuiokze lruaxoynky utre cnkt ozy vkuvrk gxk tuz uvvxkyykj