Faster integer multiplication using plain vanilla FFT primes

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.

14 pages, to appear in Mathematics of Computation