Fast Elliptic Curve Point Multiplication using Double-Base Chains

V.  S.  Dimitrov; L.  Imbert; P.  K.  Mishra

Paper 2005/069

Fast Elliptic Curve Point Multiplication using Double-Base Chains

V. S. Dimitrov, L. Imbert, and P. K. Mishra

Abstract

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.

Metadata

Available format(s): PDF PS
Publication info: Published elsewhere. Unknown where it was published
Keywords: Elliptic curve cryptography scalar multiplication double-base number system
Contact author(s): Laurent Imbert @ lirmm fr
History: 2005-03-02: received
Short URL: https://ia.cr/2005/069
License: CC BY

BibTeX

@misc{cryptoeprint:2005/069,
      author = {V.  S.  Dimitrov and L.  Imbert and P.  K.  Mishra},
      title = {Fast Elliptic Curve Point Multiplication using Double-Base Chains},
      howpublished = {Cryptology {ePrint} Archive, Paper 2005/069},
      year = {2005},
      url = {https://eprint.iacr.org/2005/069}
}