International Association for Cryptologic Research

International Association
for Cryptologic Research

CryptoDB

Xiaofeng Liao

Publications

Year
Venue
Title
2006
EPRINT
Fast Elliptic Scalar Multiplication using New Double-base Chain and Point Halving
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.

Coauthors

Lee-Ming Cheng (1)
Edward C.W. Lee (1)
K.W. Wong (1)