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

13 years 11 months ago

Download eprint.iacr.org

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

Real-time Traffic

AMC 2006 | Double-base Chain | Elliptic Curve Cryptosystems | Scalar Multiplication |

claim paper

» Faster Scalar Multiplication on Koblitz Curves Combining Point Halving with the Frobenius ...

» DoubleBase Number System for Multiscalar Multiplications

» Efficient Arithmetic on Koblitz Curves

» New Point Addition Formulae for ECC Applications

» A Binary Redundant Scalar Point Multiplication in Secure Elliptic Curve Cryptosystems

» Fast Multibase Methods and Other Several Optimizations for Elliptic Curve Scalar Multiplic...

» Comparison of Simple Power Analysis Attack Resistant Algorithms for an Elliptic Curve Cryp...

» Twisted Edwards Curves Revisited

Post Info
More Details (n/a)

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)

Sciweavers

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

AMC 2006 | Double-base Chain | Elliptic Curve Cryptosystems | Scalar Multiplication |

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers