On Decreasing the Computing Time for Modular Arithmetic
Heindel, Lee E.; Horowitz, Ellis
In this paper it is shown that by suitably modifying Garner's algorithm for applying the Chinese Remainder Theorem to optimally employ the fast multiplication techniques of Schonhage and Strassen, one can often decrease the computing time of algebraic algorithms employing modular (congruence, residue) arithmetic.
computer science; technical report
Previously Published As