You are looking at a specific version 20060329:194952 of this paper.
See the latest version.
Paper 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.
Note: Nil.
Metadata
- Available format(s)
- Category
- Public-key cryptography
- Publication info
- Published elsewhere. Not submitted to a journal yet.
- Keywords
- elliptic curve cryptosystem
- Contact author(s)
- itkwwong @ cityu edu hk
- History
- 2006-03-29: received
- Short URL
- https://ia.cr/2006/124
- License
-
CC BY