A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Fast Integer Multiplication Using Modular Arithmetic
2013
SIAM journal on computing (Print)
We give an N · log N · 2 O(log * N ) time algorithm to multiply two N -bit integers that uses modular arithmetic for intermediate computations instead of arithmetic over complex numbers as in Fürer's algorithm, which also has the same and so far the best known complexity. The previous best algorithm using modular arithmetic (by Schönhage and Strassen) has complexity O(N · log N · log log N ). The advantage of using modular arithmetic as opposed to complex number arithmetic is that we can
doi:10.1137/100811167
fatcat:7jy5vrfat5gmjbuuhfeu3cm5xu