Mathematics of Computation
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.
This is an electronic copy of an article originally publishing in Mathematics of Computation. Archived with permission. The author(s) reserves all rights.
Daniel J. Bernstein and Jonathan P. Sorenson. "Modular exponentiation via the explicit Chinese remainder theorem" Mathematics of Computaion 76.257 (2007): 443-454.