Analysis of Elliptic Curve Cryptography & RSA

Abstract

In today’s digital world, the Internet is an essential component of communication networks. It provides a platform for quickly exchanging information among communicating parties. There is a risk of unauthorized persons gaining access to our sensitive information while it is being transmitted. Cryptography is one of the most effective and efficient strategies for protecting our data and it are utilized all around the world. The efficiency of a cryptography algorithm is determined by a number of parameters, one of which is the length of the key. For cryptography, key (public/private) is an essential part. To provide robust security, RSA takes larger key size. If we use larger key size, the processing performance will be slowed. As a result, processing speed will decrease and memory consumption will increase. Due to this, cryptographic algorithms with smaller key size and higher security are becoming more popular. Out of the cryptographic algorithms, Elliptic Curve Cryptography (ECC) provides equivalent level of safety which RSA provides, but it takes smaller key size. On the basis of key size, our work focused on, studied, and compared the efficacy in terms of security among the well-known public key cryptography algorithms, namely ECC (Elliptic Curve Cryptography) and RSA (Rivets Shamir Adelman).

Design and Implementation of Discrete Field Arithmetic-Based Cylindrical Coil-Driven Crypto Framework for Cloud Data

“…Two modifications were suggested by [9] to expedite RSA decryption. Batch Multi-Prime RSA quickens RSA decryption by combining multi-prime RSA with batch RSA.…”

“…ECC offers information privacy while communicating. The Elliptic Curve Discrete Logarithm Problem is the foundation for this scheme's security [9]. Elliptic Curve Cryptography (ECC) over GF(p) has been implemented efficiently and quickly on hardware, according to.…”