An Efficient Method for Enhancement of RSA Algorithm
R Dineshkumaar, A S Shridharan, Yogendra Prasath S, Praveen Sanjay B, D. Jeyabharathi · SSRN Electronic Journal · 2020
In today’s world we are using more and more technologies in lives and generating large amounts of data. It has become a necessity to maintain a high security for any online data. For a long year RSA Algorithm is introduced by Rivest, Shamir, and Adleman. It has contribute to provide a strong security but the two disadvantage of this algorithm is that i) It takes more time to calculate and provide the output result, To overcome this (CRT) Chinese Remainder Theorem is used in decryption side of the RSA algorithm and another one is that ii) two large prime numbers which is easily guessed by an intruder or the attacker by brute-force method or any other method, This problem can be overcome by eliminating the transferring of n (the multiplication value of two prime numbers) and create new prime number from n and transfer this, so that an intruder cannot guess the factors of n.