Faster integer multiplication using plain vanilla FFT primes
David Harvey, Joris van der Hoeven · Mathematics of Computation · 2017
Assuming a conjectural upper bound for the least prime in an arithmetic progression, we show that n n -bit integers may be multiplied in O ( n log n 4 log ∗ n ) O(n \log n\, 4^{\log ^* n}) bit operations.