Rivest, Shamir and Adleman (RSA) algorithm is one of the most well-known public key cyptosystem algorithms. Although it’s been in use for a long time, a

few fruitful attacks have been designed to break it due to the way its derived.

The algorithm’s security is primarily based on the difficultly of factoring the prod uct of two chosen large numbers. The RSA public key algorithm uses one

key for encryption and another key for decryption and the choice of these keys

should be handled delicately. Many analysts have presented ways to improve the efficiency and resis tance of the RSA algorithm. In this paper, we conceal

the values of the publicly communicated parameters of public key, namely the

encryption key and common modulus, from the public. The implementation of this concept makes use of two separate algorithms and randomly selecting

between them using a random number generator.

The choice is communicated to the receiver so they know the proper algorithm to use. Lastly, we will followa quicker implementation of the modular

exponentiation technique used in RSA encryption and decryption.

The post Application of Prime Numbers in Cryptography: A Review on RSA Algorithm first appeared on COMPLIANT PAPERS.