论文信息 - Optimization Algorithm for Scalar Multiplication in the Elliptic Curve Cryptography over Prime Field

Optimization Algorithm for Scalar Multiplication in the Elliptic Curve Cryptography over Prime Field

Elliptic curve cryptography (ECC) is a major public-key cryptosystem standard in data security systems due to its high strength of security. But its application was limited because of the constraint of its speed. Therefore, it is much necessary to develop efficient method for ECC implementation. In this paper, the efficient algorithm for scalar multiplication in ECC was discussed and the corresponding comparative results were given. An optimization technique based on sliding-window non-adjacent form (NAF-Window) algorithm for the high-speed operation of point doubling and point addition over prime fields in ECC system were proposed. The results of numerical tests and performance comparisons manifested that the proposed algorithm can remarkably improve the computational efficiency of scalar multiplication. Hence, it has practical significance for the implementation of ECC and is expected to be applied to data security.

[1] Kazuo Ohta,et al. Advances in Cryptology — ASIACRYPT’98 , 2002, Lecture Notes in Computer Science.

[2] Alfred Menezes,et al. Elliptic curve public key cryptosystems , 1993, The Kluwer international series in engineering and computer science.

[3] Erkay Savas,et al. A design framework for scalable and unified architectures that perform multiplication in GF(p) and GF(2^m) , 2004 .

[4] Shinichi Kawamura,et al. A fast modular exponentiation algorithm , 1991 .

[5] K. Lauter,et al. The advantages of elliptic curve cryptography for wireless security , 2004, IEEE Wireless Communications.

[6] Atsuko Miyaji,et al. Efficient Elliptic Curve Exponentiation Using Mixed Coordinates , 1998, ASIACRYPT.

[7] Alfred Menezes,et al. The State of Elliptic Curve Cryptography , 2000, Des. Codes Cryptogr..

[8] N. Koblitz. Elliptic curve cryptosystems , 1987 .