Fast Polynomial Multiplication over F 2 60

DOI10.1145/2930889.2930920zbMath1360.68935OpenAlexW2488627717MaRDI QIDQ2985835

Grégoire Lecerf, David I. Harvey, Joris van der Hoeven

Publication date: 10 May 2017

Published in: Proceedings of the ACM on International Symposium on Symbolic and Algebraic Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2930889.2930920

zbMATH Keywords

finite fieldspolynomial multiplicationMathemagix

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Polynomials over finite fields (11T06)

Related Items (6)

A strategy to optimize the complexity of Chudnovsky-type algorithms over the projective line ⋮ Even faster integer multiplication ⋮ Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) ⋮ Faster integer multiplication using short lattice vectors ⋮ Faster integer multiplication using plain vanilla FFT primes ⋮ Fast Hermite interpolation and evaluation over finite fields of characteristic two

Uses Software

• Mathemagix

This page was built for publication: Fast Polynomial Multiplication over F _{2 60}