Efficient Quintuple Formulas for Elliptic Curves and Efficient Scalar Multiplication Using Multibase Number Representation

In the current work we propose two efficient formulas for computing the 5-fold (5P) of an elliptic curve point P. One formula is for curves over finite fields of even characteristic and the other is for curves over prime fields. Double base number systems (DBNS) have been gainfully exploited to compute scalar multiplication efficiently in ECC. Using the proposed point quintupling formulas one can use 2, 5 and 3, 5 (besides 2, 3) as bases of the double base number system. In the current work we propose a scalar multiplication algorithm, which uses a representation of the scalar using three bases 2, 3 and 5 and computes the scalar multiplication very efficiently. The proposed scheme is faster than all sequential scalar multiplication algorithms reported in literature.

[1]  Siva Sai Yerubandi,et al.  Differential Power Analysis , 2002 .

[2]  Roberto Maria Avanzi,et al.  Extending Scalar Multiplication Using Double Bases , 2006, ASIACRYPT.

[3]  Alfred Menezes,et al.  Field inversion and point halving revisited , 2004, IEEE Transactions on Computers.

[4]  Vassil S. Dimitrov,et al.  FPGA Implementation of Point Multiplication on Koblitz Curves Using Kleinian Integers , 2006, CHES.

[5]  Victor S. Miller,et al.  Use of Elliptic Curves in Cryptography , 1985, CRYPTO.

[6]  Christophe Doche,et al.  Efficient Scalar Multiplication by Isogeny Decompositions , 2005, IACR Cryptol. ePrint Arch..

[7]  R. Tijdeman,et al.  On the maximal distance between integers composed of small primes , 1974 .

[8]  Nigel P. Smart,et al.  Elliptic Curves in Cryptography: Preface , 1999 .

[9]  Atsuko Miyaji,et al.  Efficient Elliptic Curve Exponentiation Using Mixed Coordinates , 1998, ASIACRYPT.

[10]  Marc Joye,et al.  Trading Inversions for Multiplications in Elliptic Curve Cryptography , 2006, Des. Codes Cryptogr..

[11]  Graham A. Jullien,et al.  Theory and applications for a double-base number system , 1997, Proceedings 13th IEEE Sympsoium on Computer Arithmetic.

[12]  Roberto Maria Avanzi,et al.  Scalar Multiplication on Koblitz Curves Using Double Bases , 2006, VIETCRYPT.

[13]  Ricardo Dahab,et al.  An improvement of the Guajardo-Paar method for multiplication on non-supersingular elliptic curves , 1998, Proceedings SCCC'98. 18th International Conference of the Chilean Society of Computer Science (Cat. No.98EX212).

[14]  Alfred Menezes,et al.  Guide to Elliptic Curve Cryptography , 2004, Springer Professional Computing.

[15]  Marc Joye,et al.  Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity , 2004, IEEE Transactions on Computers.

[16]  Laurent Imbert,et al.  Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains , 2005, ASIACRYPT.

[17]  Alfred Menezes,et al.  Software Implementation of Elliptic Curve Cryptography over Binary Fields , 2000, CHES.

[18]  Tanja Lange,et al.  Handbook of Elliptic and Hyperelliptic Curve Cryptography , 2005 .

[19]  Marc Joye,et al.  Protections against Differential Analysis for Elliptic Curve Cryptography , 2001, CHES.

[20]  Kouichi Itoh,et al.  Fast Implementation of Public-Key Cryptography ona DSP TMS320C6201 , 1999, CHES.

[21]  Francesco Sica,et al.  An Analysis of Double Base Number Systems and a Sublinear Scalar Multiplication Algorithm , 2005, Mycrypt.

[22]  Christof Paar,et al.  Efficient Algorithms for Elliptic Curve Cryptosystems , 1997, CRYPTO.

[23]  Paul C. Kocher,et al.  Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems , 1996, CRYPTO.

[24]  Ian F. Blake,et al.  Elliptic curves in cryptography , 1999 .

[25]  Laurent Imbert,et al.  Extended Double-Base Number System with Applications to Elliptic Curve Cryptography , 2006, INDOCRYPT.

[26]  I-Ngo Chen,et al.  An algorithm for modular exponentiation , 1981, 1981 IEEE 5th Symposium on Computer Arithmetic (ARITH).

[27]  Tsuyoshi Takagi,et al.  Fast Elliptic Curve Multiplications Resistant against Side Channel Attacks , 2005, IEICE Trans. Fundam. Electron. Commun. Comput. Sci..

[28]  Jean-Sébastien Coron,et al.  Resistance against Differential Power Analysis for Elliptic Curve Cryptosystems , 1999, CHES.

[29]  N. Koblitz.  Elliptic curve cryptosystems , 1987 .