Fast integer multiplication using generalized Fermat primes - Inria - Institut national de recherche en sciences et technologies du numérique
Preprints, Working Papers, ... Year : 2016

Fast integer multiplication using generalized Fermat primes

Abstract

For almost 35 years, Schönhage-Strassen's algorithm has been the fastest algorithm known for multiplying integers, with a time complexity $O(n \cdot \log n \cdot \log \relax \log n)$ for multiplying $n$-bit inputs. In 2007, Fürer proved that there exists $K>1$ and an algorithm performing this operation in $O(n \cdot \log n \cdot K^{\log^* n})$. Recent work by Harvey, van der Hoeven, and Lecerf showed that this complexity estimate can be improved in order to get $K=8$, and conjecturally $K=4$. We obtain here the same result $K=4$ using simple modular arithmetic as a building block, and a careful complexity analysis. We obtain a similar result $K=4$ using an alternative somewhat simpler algorithm, which relies on arithmetic modulo generalized Fermat primes.
Fichier principal
Vignette du fichier
conjfim.pdf (450.93 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-01108166 , version 1 (22-01-2015)
hal-01108166 , version 2 (28-01-2016)
hal-01108166 , version 3 (10-08-2017)
hal-01108166 , version 4 (13-04-2018)

Identifiers

Cite

Svyatoslav Covanov, Emmanuel Thomé. Fast integer multiplication using generalized Fermat primes. 2016. ⟨hal-01108166v2⟩
1198 View
1486 Download

Altmetric

Share

More