Fast integer multiplication using generalized Fermat primes

DOI10.1090/mcom/3367zbMath1412.68304arXiv1502.02800OpenAlexW2962979000MaRDI QIDQ4612576

Emmanuel Thomé, Svyatoslav Covanov

Publication date: 31 January 2019

Published in: Mathematics of Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1502.02800

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Primes (11A41)

Related Items

Polynomial Multiplication over Finite Fields in Time \( O(n \log n \), Integer multiplication in time \(O(n\log n)\), Faster integer multiplication using plain vanilla FFT primes, Unnamed Item

Uses Software

• gmp

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Even faster integer multiplication
• Faster polynomial multiplication via multipoint Kronecker substitution
• Primes in progressions to moduli with a large power factor
• Fast multiplication of large numbers
• Distribution of generalized Fermat prime numbers
• Modern Computer Arithmetic
• A Heuristic Asymptotic Formula Concerning the Distribution of Prime Numbers
• Faster relaxed multiplication
• Faster Integer Multiplication
• On the distribution of amicable numbers.
• An Algorithm for the Machine Calculation of Complex Fourier Series
• Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier–Manin Operator