[Resource Topic] 2005/069: Fast Elliptic Curve Point Multiplication using Double-Base Chains

Welcome to the resource topic for 2005/069

Fast Elliptic Curve Point Multiplication using Double-Base Chains

Authors: V. S. Dimitrov, L. Imbert, P. K. Mishra


Among the various arithmetic operations required in implementing public key
cryptographic algorithms, the elliptic curve point multiplication has probably
received the maximum attention from the research community in the
last decade.
Many methods for efficient and secure implementation of point
multiplication have been proposed.
The efficiency of these methods mainly depends on the representation
one uses for the scalar multiplier.
In the current work we propose an efficient algorithm based on the
so-called double-base number system.
We introduce the new concept of double-base chains which, if
manipulated with care, can significantly reduce the complexity of
scalar multiplication on elliptic curves.
Besides we have adopted some other measures to further reduce the
operation count.
Our algorithm compares favorably against classical and other
similar approaches.

ePrint: https://eprint.iacr.org/2005/069

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 .