Document Type
Article
Publication Date
2007
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.
Recommended Citation
Bernstein, Daniel J. and Sorenson, Jonathan P., "Modular exponentiation via the explicit Chinese remainder theorem" (2007). Scholarship and Professional Work - LAS. Paper 96.
http://digitalcommons.butler.edu/facsch_papers/96