Fast elliptic scalar multiplication using new double-base chain and point halving

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

• Type: Journal
• Year: 2006
• Where: AMC
• Authors: Kwok-Wo Wong, Edward C. W. Lee, L. M. Cheng, Xiaofeng Liao
• Keywords: AMC 2006, Double-base Chain, Elliptic Curve Cryptosystems, Scalar Multiplication