Abstract

Public-key cryptographic systems often involve raising elements of some group (e.g. GF(2 n), Z/NZ, or elliptic curves) to large powers. An important question is how fast this exponentiation can be done, which often determines whether a given system is practical. The best method for exponentiation depends strongly on the group being used, the hardware the system is implemented on, and whether one element is being raised repeatedly to different powers, different elements are raised to a fixed power, or both powers and group elements vary. This problem has received much attention, but the results are scattered through the literature. In this paper we survey the known methods for fast exponentiation, examining their relative strengths and weaknesses. 1

Citations

2507	A method for obtaining digital signatures and public-key cryptosystems - Rivest, Shamir, et al.
2292	New Directions in Cryptography - Diffie, Hellman - 1976
337	Modular multiplication without trial division - Montgomery - 1985
262	Elliptic Curve Public Key Cryptosystems - Menezes - 1993
243	Reducing elliptic curve logarithms to logarithms in a finite field - Menezes, Okamoto, et al. - 1993
228	Introduction to Coding Theory - Lint - 1982
121	Seminumerical Algorithms, volume 2 of The Art of Computer Programming - Knuth - 1997
104	CM-Curves with Good Cryptographic Properties - Koblitz - 1991
86	Speeding up the computations on an elliptic curve using addition-subtraction chains - Morain, Olivos - 1990
78	An Improved Algorithm for Arithmetic on a Family of Elliptic Curves - Solinas - 1997
64	More flexible exponentiation with precomputation - Lim, Lee - 1994
61	Fast exponentiation with precomputation - Brickell, Gordon, et al. - 1992
41	Addition chain heuristics - Bos, Coster - 1990
40	Detecting perfect powers in essentially linear time - Bernstein - 1998
30	R.: Computing sequences with addition chains - Downey, Leong, et al. - 1981
29	Speeding up elliptic cryptosystems by using a signed binary window method - Koyama, Tsuruoka - 1992
26	Efficient exponentiation using precomputation and vector addition chains - Rooij - 1994
22	On the evaluation of powers - Yao - 1976
18	Ecient multiplication on certain nonsupersingular elliptic curves - Meier, Staelbach - 1993
15	Using Smoothness to Achieve Parallelism - Adleman, Kompella - 1988
13	On Vectorial Addition Chains - Olivos - 1981
9	Some Observations on Parallel Algorithms for Fast Exponentiation - Stinson - 1990
9	Fundamentals of Algorithms. 2 nd ed - Knuth - 1973
8	Fast exponentiation with precomputation: Algorithms and lower bounds - Brickell, Gordon, et al. - 1995
8	New Modular Multiplication algorithms for fast modular exponeniation - Hong, Oh, et al. - 1996
7	Remarks on number theory III. On addition chains - Erdős - 1960
7	zur Gathen. Computing powers in parallel - von - 1987
5	zur Gathen. Efficient exponentiation in finite fields - von - 1991
5	zur Gathen. Efficient and optimal exponentiation in finite fields - von - 1991
4	and Kireeti Kompella. Using smoothness to achieve parallelism - Adleman - 1988
4	Lim and Pil Joong Lee, More flexible exponentiation with precomputation - Hoon - 1994
3	Some Primality Testing Algorithms - Pinch - 1993
3	Fast exponentiation - Agnew, Mullin, et al. - 1988
2	Fast exponentiation in GF(2 n - Agnew, Mullin, et al. - 1988
2	Private communication - Poonen
1	Signed digit represenations of minimal Hamming weight - Arno, Wheeler - 1993