Paper 2005/069

Fast Elliptic Curve Point Multiplication using Double-Base Chains

V. S. Dimitrov, L. Imbert, and 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.

Available format(s)
Publication info
Published elsewhere. Unknown where it was published
Elliptic curve cryptographyscalar multiplicationdouble-base number system
Contact author(s)
Laurent Imbert @ lirmm fr
2005-03-02: received
Short URL
Creative Commons Attribution


      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},
      note = {\url{}},
      url = {}
Note: In order to protect the privacy of readers, does not use cookies or embedded third party content.