DocumentCode :
2816299
Title :
Fast Multi-Scalar Multiplication Using the Multi-Based Number System
Author :
Yin, Xinchun ; Zhang, Hailing ; Zhao, Rong
Author_Institution :
Dept. of Inf. Technol. & Eng., Yangzhou Univ., Yangzhou, China
fYear :
2009
fDate :
11-13 Dec. 2009
Firstpage :
1
Lastpage :
4
Abstract :
As a generalization of double base chains, multi-base number system is very suitable for efficient computation of scalar multiplications of elliptic curves because of shorter representation length and less Hamming weight. In this paper, combined with the given formulas for computing the 5-fold of an elliptic curve point P, an efficient scalar multiplication algorithm of elliptic curve is proposed using 2, 3 and 5 as bases of the multi-based number system. The algorithms cost less compared with Shamir´s trick and interleaving with NAFs method.
Keywords :
number theory; public key cryptography; Hamming weight; elliptic curves; multibase number system; multiscalar multiplication; Costs; Cryptographic protocols; Elliptic curve cryptography; Elliptic curves; Equations; Greedy algorithms; H infinity control; Hamming weight; Information technology; Interleaved codes;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Computational Intelligence and Software Engineering, 2009. CiSE 2009. International Conference on
Conference_Location :
Wuhan
Print_ISBN :
978-1-4244-4507-3
Electronic_ISBN :
978-1-4244-4507-3
Type :
conf
DOI :
10.1109/CISE.2009.5363303
Filename :
5363303
Link To Document :
بازگشت