## A Survey of Fast Exponentiation Methods (1998)

### Cached

### Download Links

- [www.ccrwest.org]
- [sites.google.com]
- [saluc.engr.uconn.edu]
- [khan.postech.ac.kr]
- [www.ccrwest.org]
- DBLP

### Other Repositories/Bibliography

Venue: | Journal of Algorithms |

Citations: | 153 - 0 self |

### BibTeX

@ARTICLE{Gordon98asurvey,

author = {Daniel M. Gordon},

title = {A Survey of Fast Exponentiation Methods},

journal = {Journal of Algorithms},

year = {1998},

volume = {27},

pages = {129--146}

}

### Years of Citing Articles

### OpenURL

### 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