Welcome to the resource topic for 2006/124
Title:
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
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.
ePrint: https://eprint.iacr.org/2006/124
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .