Can I read Faster Integer and Polynomial Multiplication Using Cyclotomic Coefficient Rings on EtoBox?

Faster Integer and Polynomial Multiplication Using Cyclotomic Coefficient Rings by Harvey, David; van der Hoeven, Joris is a scholarly article available to read on EtoBox.

What is Faster Integer and Polynomial Multiplication Using Cyclotomic Coefficient Rings about?

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}). We also prove that for a fixed prime p, polynomials in F_p[X] of degree n may be multiplied in O(n log n 4^{log^* n}) bit operations; the previous best bound was O(n log n 8^{log^* n}).

Author

Harvey, David; van der Hoeven, Joris

Published

2017

Language

EN