# Faster integer multiplication using plain vanilla FFT primes

(with Joris van der Hoeven)

arXiv preprint (November 2016).

To appear in Mathematics of Computation.

## Abstract

Assuming a conjectural upper bound for the least prime in an arithmetic progression, we show that *n*-bit integers may be multiplied in *O*(*n* log *n* 4^{log* n}) bit operations.

Back to the main page