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 4log*n) bit operations