Fast integer multiplication using \goodbreak generalized Fermat primes

@article{Covanov2019FastIM,
  title={Fast integer multiplication using \goodbreak generalized Fermat primes},
  author={Svyatoslav Covanov and Emmanuel Thom{\'e}},
  journal={Math. Comput.},
  year={2019},
  volume={88},
  pages={1449-1477}
}
For almost 35 years, Schonhage-Strassen's algorithm has been the fastest algorithm known for multiplying integers, with a time complexity O(n · log n · log log n) for multiplying n-bit inputs. In 2007, Furer proved that there exists K > 1 and an algorithm performing this operation in O(n · log n · 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. Using an alternative algorithm, which… 
Polynomial Multiplication over Finite Fields in Time \( O(n \log n \)
TLDR
It is shown that polynomials of degree less than n over a finite field with q elements can be multiplied in time, uniformly in q, and how to multiply two n -bit integers in time is shown.
Brief Announcement: On the I/O Complexity of Sequential and Parallel Hybrid Integer Multiplication Algorithms
  • Lorenzo De Stefani
  • Computer Science
    Proceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures
  • 2022
TLDR
This work presents an Ω((n/max(M,n0) (max(1,n_0/M))2M) lower bound for the I/O complexity of a class of "uniform, non-stationary" hybrid algorithms, where n0 denotes the threshold size of sub-problems which are computed using standard algorithms with algebraic complexity Ω(n2).
On the I/O complexity of hybrid algorithms for Integer Multiplication
TLDR
The lower bound is derived for the more general class of "non-uniform, non-stationary" hybrid algorithms which allow recursive calls to have a different structure, even when they refer to the multiplication of integers of the same size and in the same recursive level including those where the value of $k$ is allowed to vary with the level of recursion.
Big Prime Field FFT on Multi-core Processors
TLDR
A multi-threaded implementation of Fast Fourier Transforms over generalized Fermat prime fields is reported on, overcome the less fine control of hardware resources by successively using FFT in support of the multiplication in those fields.

References

SHOWING 1-10 OF 15 REFERENCES
Fast integer multiplication using modular arithmetic
TLDR
An algorithm for multiplying two N-bit integers that improves the O(N • log N • log log N) algorithm by Schönhage-Strassen and can be viewed as a p-adic version of Fürer's algorithm.
Even faster integer multiplication
Asymptotically Fast Algorithms for the Numerical Multiplication and Division of Polynomials with Complex Coeficients
TLDR
Under reasonable assumptions, polynomial multiplication and discrete Fourier transforms of length n and in l-bit precision are possible in time O(ψ (nl), and division of polynomials in O(n(l+n))).
A gmp-based implementation of schönhage-strassen's large integer multiplication algorithm
TLDR
An improved implementation of Schönhage-Strassen's algorithm, based on the one distributed within the GMP library is presented, with improvements to faster arithmetic modulo 2n + 1, improved cache locality and tuning.
Distribution of generalized Fermat prime numbers
TLDR
A computational method for testing the probable primality of a GFN is described, which can be used to support Bateman and Horn's quantitative form of "Hypothesis H" of Schinzel and Sierpinski.
A heuristic asymptotic formula concerning the distribution of prime numbers
Suppose fi, f2, -*, fk are polynomials in one variable with all coefficients integral and leading coefficients positive, their degrees being hi, h2, **. , hk respectively. Suppose each of these
Modern Computer Arithmetic
Modern Computer Arithmetic focuses on arbitrary-precision algorithms for efficiently performing arithmetic operations such as addition, multiplication and division, and their connections to topics
Faster polynomial multiplication via multipoint Kronecker substitution
  • David Harvey
  • Mathematics, Computer Science
    J. Symb. Comput.
  • 2009
Schnelle Multiplikation großer Zahlen
ZusammenfassungEs wird ein Algorithmus zur Berechnung des Produktes von zweiN-stelligen Dualzahlen angegeben. Zwei Arten der Realisierung werden betrachtet: Turingmaschinen mit mehreren Bändern und
An algorithm for the machine calculation of complex Fourier series
TLDR
Good generalized these methods and gave elegant algorithms for which one class of applications is the calculation of Fourier series, applicable to certain problems in which one must multiply an N-vector by an N X N matrix which can be factored into m sparse matrices.
...
...