Security Enhancement of RSA Algorithm using Increased Prime Number Set
Nitin Jain1, Surendra Singh Chauhan2, Alok Raj3
1Nitin Jain*, Department of AIT-CSE, Chandigarh University, Gharuan, Mohali, India.
2Surendra Singh Chauhan, Department of Computer Science, Pratap University, Jaipur, India.
3Alok Raj, Department of AIT-CSE, Chandigarh University, Mohali, India.
Manuscript received on January 20, 2020. | Revised Manuscript received on February 05, 2020. | Manuscript published on February 29, 2020. | PP: 4235-4240 | Volume-9 Issue-3, February 2020. | Retrieval Number: C6278029320/2020©BEIESP | DOI: 10.35940/ijeat.C6278.029320
Open Access | Ethics and Policies | Cite | Mendeley
© The Authors. 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: SIn this era of digital age a lot of secret and non-secret data is transmitted over the internet. Cryptography is one of the many techniques to secure data on network. It is one of the techniques that can be used to ensure information security and data privacy. It is used to secure data in rest as well as data in transit. RSA in the most commonly used cryptographic algorithm and it is also used for the creation on Digital Certificates. RSA algorithm is now not considered to be as secure due to advancement in technology and newer attack vectors. This paper proposed an algorithm for security enhancement of RSA algorithm by increasing prime numbers count. Proposed algorithm has been implemented to encrypt and decrypt the data and execution results for encryption and decryption time have been compared for increased prime numbers count. This proposed algorithm of RSA can be used to replace the existing RSA algorithm in digital signature certificates as well as in all other places where the base RSA algorithm is currently being used. In the proposed technique, as the number of prime number count increases, prime factor calculation becomes difficult. If the attacker has encryption key (e) and Product of prime numbers (N) then it is not easy to find out the prime number combinations and hence decryption key (d) will be more secure by using proposed algorithm. This will be more difficult because given a number n, it is easy to find two numbers whose product is equal to n using Shor’s algorithm and Grover’s Search Algorithm but it is not very difficult and time taking to exactly determine m numbers whose product is equal to n.
Keywords: Cipher Text, Decryption, Decryption Time, Encryption, Encryption Time, Plain Text, RSA Algorithm.