Paper Info
Title
Optimization Algorithm for Scalar Multiplication in the Elliptic Curve Cryptography over Prime Field
Abstract
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.
Year
DOI
Venue
2008
10.1007/978-3-540-87442-3_111
ICIC (1)
Keywords
Field
DocType
point doubling,scalar multiplication,efficient method,data security system,elliptic curve cryptography,efficient algorithm,proposed algorithm,ecc implementation,optimization algorithm,data security,prime field,point addition,ecc system,sliding window
Prime (order theory),Elliptic Curve Digital Signature Algorithm,Non-adjacent form,Multiplication algorithm,Scalar multiplication,Computer science,Arithmetic,Cryptosystem,Elliptic curve point multiplication,Elliptic curve cryptography
Conference
Volume
ISSN
Citations 
5226
0302-9743
3
PageRank 
References 
Authors
0.47
4
6
Name
Order
Citations
PageRank
Yuanling Hao130.47
Shiwei Ma213621.79
Guanghua Chen381.90
Xiaoli Zhang49214.66
Hui Chen541.50
Weimin Zeng631.48