Document Type

Article

Publication Date

2007

Publication Title

Mathematics of Computation

First Page

443

Last Page

454

DOI

http://dx.doi.org/10.1090/S0025-5718-06-01849-7

Abstract

In this paper we consider the problem of computing xe mod m for large integers x, e, and m. This is the bottleneck in Rabin’s algorithm for testing primality, the Diffie-Hellman algorithm for exchanging cryptographic keys, and many other common algorithms.

Rights

This is an electronic copy of an article originally publishing in Mathematics of Computation. Archived with permission. The author(s) reserves all rights.

COinS