Improved Techniques for Fast Exponentiation

We present improvements to algorithms for efficient exponentiation. The fractional window technique is a generalization of the sliding window and window NAF approach; it can be used to improve performance in devices with limited storage. Window NAF splitting is an efficient technique for exponentiation with precomputation for fixed bases in groups where inversion is easy (e.g. elliptic curves).

[1]  George W. Reitwiesner,et al.  Binary Arithmetic , 1960, Adv. Comput..

[2]  Donald Ervin Knuth,et al.  The Art of Computer Programming, Volume II: Seminumerical Algorithms , 1970 .

[3]  Edward G. Thurber.  On addition chains $1(mn)\leq 1(n)-b$ and lower bounds for $c(r)$ , 1973 .

[4]  Andrew Chi-Chih Yao,et al.  On the Evaluation of Powers , 1976, SIAM J. Comput..

[5]  Nicholas Pippenger,et al.  On the evaluation of powers and related problems , 1976, 17th Annual Symposium on Foundations of Computer Science (sfcs 1976).

[6]  Donald E. Knuth,et al.  The art of computer programming. Vol.2: Seminumerical algorithms , 1981 .

[7]  Chae Hoon Lim,et al.  More Flexible Exponentiation with Precomputation , 1994, CRYPTO.

[8]  Hilarie K. Orman,et al.  Fast Key Exchange with Elliptic Curve Systems , 1995, CRYPTO.

[9]  Jerome A. Solinas.  An Improved Algorithm for Arithmetic on a Family of Elliptic Curves , 1997, CRYPTO.

[10]  Atsuko Miyaji,et al.  Efficient elliptic curve exponentiation , 1997, ICICS.

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

[12]  Daniel M. Gordon,et al.  A Survey of Fast Exponentiation Methods , 1998, J. Algorithms.

[13]  Jerome A. Solinas,et al.  Efficient Arithmetic on Koblitz Curves , 2000, Des. Codes Cryptogr..

[14]  W. Bosma,et al.  Signed bits and fast exponentiation , 2001 .

[15]  Bodo Möller.  Algorithms for Multi-exponentiation , 2001, Selected Areas in Cryptography.

[16]  尚弘 島影.  National Institute of Standards and Technologyにおける超伝導研究及び生活 , 2001 .

[17]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[18]  Marc Joye,et al.  Compact Encoding of Non-adjacent Forms with Applications to Elliptic Curve Cryptography , 2001, Public Key Cryptography.

[19]  Kouichi Sakurai,et al.  Algorithms for Efficient Simultaneous Elliptic Scalar Multiplication with Reduced Joint Hamming Weight Representation of Scalars , 2002, ISC.