Analysis of standard elliptic curves for the implementation of elliptic curve cryptography in resource-constrained E-commerce applications
Javed R. Shaikh, Maria Nenova, Georgi Iliev, Zlatka Valkova-Jarvis
Abstract
Javed R. Shaikh, Maria Nenova, Georgi Iliev, Zlatka Valkova-Jarvis
Abstract
In the public key cryptography infrastructure of electronic commerce (E-commerce), use of the Rivest, Shamir, and Adleman (RSA) algorithm is very common. Due to the security requirements, the necessary key size of RSA is increasing exponentially. Because of this large key size, it is not convenient to use RSA in resource-constrained applications where computational speed, storage and bandwidth are limited. Elliptic Curve Cryptography (ECC) is the best alternative to the traditional RSA. ECC provides the same level of security as RSA but with reduced key size. The most important factor in the use of ECC is the selection of the correct elliptic curve. There are different types of elliptic curves suggested by various standards. The selection of the curve is dependent on various parameters, such as prime field size, the shape of the curve, etc. In this paper, sets of elliptic curves recommended by different standards for cryptography are selected, and the selected curves are analysed, focusing on the performance and security features. The performance of each curve is measured in terms of computation time. The analysis is performed by considering each curve for the implementation of the Elliptic Curve Diffie-Hellman (ECDH) algorithm and the Elliptic Curve Digital Signature Algorithm (ECDSA). The comparative table of selected curves is arranged according to the computation time taken by each curve to perform various operations when used for the ECC algorithms.
OpenAlex reports 48 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In the public key cryptography infrastructure of electronic commerce (E-commerce), use of the Rivest, Shamir, and Adleman (RSA) algorithm is very common. Due to the security requirements, the necessary key size of RSA is increasing exponentially. Because of this large key size, it is not convenient to use RSA in resource-constrained applications where computational speed, storage and bandwidth are limited. Elliptic Curve Cryptography (ECC) is the best alternative to the traditional RSA. ECC provides the same level of security as RSA but with reduced key size. The most important factor in the use of ECC is the selection of the correct elliptic curve. There are different types of elliptic curves suggested by various standards. The selection of the curve is dependent on various parameters, such as prime field size, the shape of the curve, etc. In this paper, sets of elliptic curves recommended by different standards for cryptography are selected, and the selected curves are analysed, focusing on the performance and security features. The performance of each curve is measured in terms of computation time. The analysis is performed by considering each curve for the implementation of the Elliptic Curve Diffie-Hellman (ECDH) algorithm and the Elliptic Curve Digital Signature Algorithm (ECDSA). The comparative table of selected curves is arranged according to the computation time taken by each curve to perform various operations when used for the ECC algorithms.
Key concepts: Elliptic curve cryptography, Elliptic Curve Digital Signature Algorithm, Curve25519, Key size, Tripling-oriented Doche–Icart–Kohel curve, Elliptic curve point multiplication, Counting points on elliptic curves, Hessian form of an elliptic curve