Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
4636663 | Applied Mathematics and Computation | 2006 | 8 Pages |
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 1/2 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.
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Applied Mathematics
Authors
K.W. Wong, Edward C.W. Lee, L.M. Cheng, Xiaofeng Liao,