Fast Integer Multiplication using Modular Arithmetic

Anindya De, Piyush P Kurur, Chandan Saha +1

We give an $O(N\cdot \log N\cdot 2^{O({\log }^{\ast }N)})$ algorithm for multiplying two $N$-bit integers that improves the $O(N\cdot \log N\cdot \log \log N)$ algorithm by Schönhage-Strasse…