## CryptoDB

### Paper: Fast Elliptic Scalar Multiplication using New Double-base Chain and Point Halving

Authors: K.W. Wong Edward C.W. Lee L.M. Cheng Xiaofeng Liao URL: http://eprint.iacr.org/2006/124 Search ePrint Search Google 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.
##### BibTeX
@misc{eprint-2006-21617,
title={Fast Elliptic Scalar Multiplication using New Double-base Chain and Point Halving},
booktitle={IACR Eprint archive},
keywords={public-key cryptography / elliptic curve cryptosystem},
url={http://eprint.iacr.org/2006/124},
note={Not submitted to a journal yet. itkwwong@cityu.edu.hk 13235 received 28 Mar 2006},
author={K.W. Wong and Edward C.W. Lee and L.M. Cheng and Xiaofeng Liao},
year=2006
}