Faster integer multiplication using plain vanilla FFT primes
[ Homepage | Publications | Talks | TeXmacs | Mathemagix ]

Abstract

Assuming a conjectural upper bound for the least prime in an arithmetic progression, we show that -bit integers may be multiplied in bit operations.

Authors: David Harvey, Joris van der Hoeven

View: Pdf, BibTeX