Cryptology ePrint Archive: Report 2005/069

Fast Elliptic Curve Point Multiplication using Double-Base Chains

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

Category / Keywords: Elliptic curve cryptography, scalar multiplication, double-base number system

Date: received 1 Mar 2005, last revised 2 Mar 2005

Contact author: Laurent Imbert at lirmm fr

Available formats: Postscript (PS) | Compressed Postscript (PS.GZ) | PDF | BibTeX Citation

Version: 20050302:195736 (All versions of this report)

Discussion forum: Show discussion | Start new discussion