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.
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
