Fast integer multiplication using modular arithmetic

Authors:
Anindya De;Piyush P. Kurur;Chandan Saha;Ramprasad Saptharishi
Affiliations:
Indian Institute of Technology, Kanpur, Kanpur, India;Indian Institute of Technology, Kanpur, Kanpur, India;Indian Institute of Technology, Kanpur, Kanpur, India;Indian Institute of Technology, Kanpur and Chennai Mathematical Institute, Kanpur and Chennai, India
Venue:
STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing
Year:
2008

Citing 3
Cited 8

Basic notions of algebra

Basic notions of algebra
Asymptotically Fast Algorithms for the Numerical Multiplication and Division of Polynomials with Complex Coeficients

EUROCAM '82 Proceedings of the European Computer Algebra Conference on Computer Algebra
Faster integer multiplication

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing

Randomized OBDDs for the most significant bit of multiplication need exponential size

SOFSEM'11 Proceedings of the 37th international conference on Current trends in theory and practice of computer science
On the OBDD complexity of the most significant bit of integer multiplication

Theoretical Computer Science
Fast fourier transforms over poor fields

Proceedings of the 36th international symposium on Symbolic and algebraic computation
Faster polynomial multiplication via discrete fourier transforms

CSR'11 Proceedings of the 6th international conference on Computer science: theory and applications
A larger lower bound on the OBDD complexity of the most significant bit of multiplication

LATIN'10 Proceedings of the 9th Latin American conference on Theoretical Informatics
Schönhage-Strassen algorithm with MapReduce for multiplying terabit integers

Proceedings of the 2011 International Workshop on Symbolic-Numeric Computation
Most Tensor Problems Are NP-Hard

Journal of the ACM (JACM)
Exact and efficient generation of geometric random variates and random graphs

ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I

Quantified Score

Hi-index	0.00

Visualization

Abstract

We give an O(N • log N • 2O(log*N)) algorithm for multiplying two N-bit integers that improves the O(N • log N • log log N) algorithm by Schönhage-Strassen. Both these algorithms use modular arithmetic. Recently, Fürer gave an O(N • log N • 2O(log*N)) algorithm which however uses arithmetic over complex numbers as opposed to modular arithmetic. In this paper, we use multivariate polynomial multiplication along with ideas from Fürer's algorithm to achieve this improvement in the modular setting. Our algorithm can also be viewed as a p-adic version of Fürer's algorithm. Thus, we show that the two seemingly different approaches to integer multiplication, modular and complex arithmetic, are similar.