Paper 2006/124 Original: eprint.iacr.org/2006/124 ↗
Fast Elliptic Scalar Multiplication using New Double-base Chain and Point Halving
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.
Metadata
- Available format(s)
PDF- Category
- Public-key cryptography
- Publication info
- Preprint.
- History
- 2006-03-29: last updated
- 2006-03-29: published
- Short URL
- https://ia.cr/2006/124
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2006/124,
author = {K. W. Wong and Edward C. W. Lee and L. M. Cheng and Xiaofeng Liao},
title = {Fast Elliptic Scalar Multiplication using New Double-base Chain and Point Halving},
howpublished = {Cryptology {ePrint} Archive, Paper 2006/124},
year = {2006},
url = {https://eprint.iacr.org/2006/124}
}