Faster integer and polynomial multiplication using cyclotomic coefficient rings

David Harvey, Joris van der Hoeven

We present an algorithm that computes the product of two n-bit integers in O(n log n (4\sqrt 2)^{log^* n}) bit operations. Previously, the best known bound was O(n log n 6^{log^* n…