A Modified RSA Cryptosystems and Analysis
Ravi Raj1, Yogesh Shriram Solunke2
1Ravi Raj, Department of Communication Systems, IIITDM Kancheepuram, Chennai, India.
2Sriram S. Solunke, Department of Communication Systems, IIITDM Kancheepuram, Chennai, India.
Manuscript received on February 12, 2015. | Revised Manuscript received on February 13, 2015. | Manuscript published on February 25, 2015. | PP:1-3 | Volume-3 Issue-4, February 2015. | Retrieval Number: D0907023415
Open Access | Ethics and Policies | Cite
© The Authors. Published By: Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Abstract: As the growth of the Internet and electronic commerce have brought to the forefront the issue of privacy in electronic communication. Large volumes of personal and sensitive information are electronically transmitted every day. In this paper we present modified RSA algorithm and analysis for secure data transmission. The security of RSA public key cryptosystem is based on the assumption that factoring of a large number (modulus) is difficult. In RSA if one can factor modulus into its prime numbers then the private key is also detected and hence the security of the cryptosystem is broken. Encryption is the standard method for making a communication private with RSA Algorithm. In which one public key and one private have introduced, resulted from two prime number introduced. Here we have introduce n Prime number with evolve method in a modified RSA cryptosystem to provide security over the networks. So, the security of RSA public key cryptosystem is increased due to increase in difficulty of the factoring of a large number (modulus) with increase in prime number and this technique provides more efficiency and reliability over the networks.
Keywords: Key, Encryption, Decryption, n prime numbers, RSA Algorithm.