Fast elliptic scalar multiplication using new double-base chain and point halving
Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review
Author(s)
Related Research Unit(s)
Detail(s)
Original language | English |
---|---|
Pages (from-to) | 1000-1007 |
Journal / Publication | Applied Mathematics and Computation |
Volume | 183 |
Issue number | 2 |
Publication status | Published - 15 Dec 2006 |
Link(s)
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. © 2006 Elsevier Inc. All rights reserved.
Research Area(s)
- Double-base chain, Elliptic curve cryptography (ECC), Point halving
Citation Format(s)
Fast elliptic scalar multiplication using new double-base chain and point halving. / Wong, K. W.; Lee, Edward C.W.; Cheng, L. M.; Liao, Xiaofeng.
In: Applied Mathematics and Computation, Vol. 183, No. 2, 15.12.2006, p. 1000-1007.Research output: Journal Publications and Reviews (RGC: 21, 22, 62) › 21_Publication in refereed journal › peer-review