ISSN 22773061 456 | Page May30, 2013 Enhancing RSA algorithm using Mersenne Primes with reduced size of encrypted file Shilpa M Pund, Chitra G Desai Ph.D Student, Department of Computer Science, University of Pune. Maharashtra, India. shilpa_pund@yahoo.com Professor and Head, MCA Department, MIT Aurangabad, India. chitrag_desai@yahoo.com,chitragdesai@gmail.com. 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. General Terms Security, Algorithm. Indexing terms RSA, encryption, decryption, mersenne. Academic Discipline And Sub-Disciplines Computer Science. SUBJECT CLASSIFICATION E.g. Data Security using Cryptography and Steganography. TYPE (METHOD/APPROACH) Experiment, Literary Analysis. INTRODUCTION Message passing from source to destination is one of the important aspects of communication. However, it is required many times that this message be transmitted secretly, so that no unauthorized person gets knowledge of the contents of Council for Innovative Research Peer Review Research Publishing System Journal: INTERNATIONAL JOURNAL OF COMPUTERS & TECHNOLOGY Vol 7, No 1 editor@cirworld.com www.cirworld.com, member.cirworld.com