Comparative Analysis of RSA-RK and ECC-RK for Aadhaar Card

Abstract

Hackers are inventing novel strategies to breach the encrypted information of practically all existing cryptographic algorithms, and therefore network security has always been an emerging study in communication technology. “Elliptic Curve Cryptography” (ECC) is a new cryptographic approach that has been demonstrated to work in public-key cryptosystems. ECC’s benefits ensure secure data transmission across an insecure medium. The standard ECC key pact procedure is based on El-Gamal encryption. ECC is the handiest procedure for network security because it offers good security with smaller key sizes, quicker computations, lower computing power, and less storage space. By merging ECC and Runge–Kutta (RK) methods, the performance of the ECC cryptanalysis technique is enhanced in relation to speed and security in this paper. The key advantages of RK techniques are that they are simple to use and have a low error rate. The Runge–Kutta-ECC procedure is designed to improve the avalanche effect, speed, throughput, and power consumption of the method. The enhanced performance of the RKECC method is discussed, in addition to the experimental results. There is also a detailed mathematical justification for the RKECC algorithm.