Details

Autor(en) / Beteiligte

• Khan, Mohammad Rafeek
• Upreti, Kamal
• Alam, Mohammad Imran
• Khan, Haneef
• Siddiqui, Shams Tabrez
• Haque, Mustafizul
• Parashar, Jyoti

Titel

Analysis of Elliptic Curve Cryptography & RSA

Ist Teil von

• Journal of ICT Standardization, 2023, Vol.11 (4), p.355

Ort / Verlag

Tokyo: River Publishers

Erscheinungsjahr

2023

Quelle

EZB Electronic Journals Library

Beschreibungen/Notizen

• 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).