Sciweavers

AMC
2006

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

13 years 3 months ago
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
Kwok-Wo Wong, Edward C. W. Lee, L. M. Cheng, Xiaof
Added 10 Dec 2010
Updated 10 Dec 2010
Type Journal
Year 2006
Where AMC
Authors Kwok-Wo Wong, Edward C. W. Lee, L. M. Cheng, Xiaofeng Liao
Comments (0)