# Faster integer multiplication using plain vanilla FFT primes

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.

READ FULL TEXTAssuming 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.

READ FULL TEXT
research

∙
12/11/2017
research

∙
11/17/2019
research

∙
11/09/2022
research

∙
03/02/2017
research

∙
08/12/2023
research

∙
02/22/2018
research

∙
11/16/2016