Enhanced RSA Cryptosystem: A Secure and Nimble Approach
Tanay Gandhi, Meith Navlakha, Rahul Raheja, Varun Mehta, Yash Jhaveri, Narendra M. Shekokar · 2022
With the rise in Internet and Network applications in the last decade, there is a need for making communication over the internet to be more secure and strong in order to avoid cyber-attacks. The use of digital signatures has been widely used and there is a need to strengthen the existing public key algorithms. RSA is among the most common public key algorithms but is prone to security risks and attacks due to the advancing computing technology. This paper suggests a new algorithm based on RSA which increases the randomness and diffusion of the RSA algorithm making it more secure from cyber-attacks than RSA. The suggested approach employs four prime integers to generate two sets of public and private keys and involves double encryption and decryption. This modified form of the RSA method adds to the complexity of the encryption process while simultaneously decreasing the decryption time by leveraging the Chinese Remainder theorem.