An Enhanced RSA Algorithm In Modern Cryptography

Transmission of sensitive information over the internet can be intercepted or accessed by unauthorized parties. Communication over the internet must be secure to prevent intercepting or accessing sensitive information. Attempts are being made to protect confidential information by providing maximum security over the network. Using numerous prime integers for the RSA cryptosystem, which is difficult to crack, is one of these new techniques. The traditional RSA algorithm uses two prime numbers for generating keys. In this paper, our objective is to enhance the existing algorithm by using three prime numbers to generate the keys and to demonstrate the application of this algorithm created in the C programming language. We will also compare the time consumed to encode and decode the message by the traditional RSA algorithm and the enhanced RSA algorithm to get a clear idea of which algorithm is more efficient and reliable and not easily breakable by intruders.