Enhancing RSA algorithm using Mersenne Primes with reduced size of encrypted file

Abstract

Message passing from source to destination is one of the important aspects of communication. However, it is required
many times that this message gets transmitted secretly, so that no unauthorized person gets knowledge of the contents of
that message. To retain the confidentiality of the message transmitted is a challenging task as it needs to be guaranteed
that the message arrive in the right hands exactly as it was transmitted. Another challenge is of transmitting the message
over a public, insecure channel. In this paper, RSA algorithm is implemented using Mersenne Primes which guarantees
the primality. This is an enhanced algorithm which increases the strength of RSA by generating large prime numbers and
also reduces the size of encrypted file.