Cryptology ePrint Archive: Report 2006/124
Fast Elliptic Scalar Multiplication using New Double-base Chain and Point Halving
K.W. Wong and Edward C.W. Lee and L.M. Cheng and Xiaofeng Liao
Abstract: The fast implementation of elliptic curve cryptosystems relies on the efficient computation of scalar multiplication. Based on the double-base chain representation of scalar using powers of 2 and 3, we propose a new representation with powers of ½ and 3 instead. Thus the efficient point halving operation can be incorporated in the new double-base chain to achieve fast scalar multiplication. Experimental results show that our approach leads to a lower complexity which contributes to the efficient implementation of elliptic curve cryptosystems.
Category / Keywords: public-key cryptography / elliptic curve cryptosystem
Publication Info: Not submitted to a journal yet.
Date: received 28 Mar 2006
Contact author: itkwwong at cityu edu hk
Available formats: PDF | BibTeX Citation
Version: 20060329:194952 (All versions of this report)
Discussion forum: Show discussion | Start new discussion
[ Cryptology ePrint archive ]