DocumentCode
1988282
Title
A new algorithm for double scalar multiplication over Koblitz curves
Author
Adikari, Jithra ; Dimitrov, Vassil S. ; Cintra, Renato J.
Author_Institution
Dept. of Electr. & Comput. Eng., Univ. of Calgary, Calgary, AB, Canada
fYear
2011
fDate
15-18 May 2011
Firstpage
709
Lastpage
712
Abstract
Koblitz curves are a special set of elliptic curves and have improved performance in computing scalar multiplication in elliptic curve cryptography due to the Frobenius endomorphism. Double-base number system approach for Frobenius expansion has improved the performance in single scalar multiplication. In this paper, we present a new algorithm to generate a sparse and joint τ-adic representation for a pair of scalars and its application in double scalar multiplication. The new algorithm is inspired from double-base number system. We achieve 12% improvement in speed against state-of-the-art τ-adic joint sparse form.
Keywords
curve fitting; public key cryptography; Frobenius endomorphism; Frobenius expansion; Koblitz curves; double-base number system; elliptic curve cryptography; r-adic representation; scalar multiplication; sparse representation; Clocks; Computer architecture; Elliptic curve cryptography; Hardware; Joints; Registers;
fLanguage
English
Publisher
ieee
Conference_Titel
Circuits and Systems (ISCAS), 2011 IEEE International Symposium on
Conference_Location
Rio de Janeiro
ISSN
0271-4302
Print_ISBN
978-1-4244-9473-6
Electronic_ISBN
0271-4302
Type
conf
DOI
10.1109/ISCAS.2011.5937664
Filename
5937664
Link To Document