Implementing Fast Carryless Multiplication

DOI10.1007/978-3-319-72453-9_9zbMath1497.68586OpenAlexW2751347238MaRDI QIDQ4628485

Grégoire Lecerf, Joris van der Hoeven, Robin Larrieu

Publication date: 14 March 2019

Published in: Mathematical Aspects of Computer and Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-72453-9_9

Mathematics Subject Classification ID

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

Related Items (4)

Polynomial Multiplication over Finite Fields in Time \( O(n \log n \) ⋮ Faster integer multiplication using short lattice vectors ⋮ Improved method for finding optimal formulas for bilinear maps in a finite field ⋮ Faster integer multiplication using plain vanilla FFT primes

Uses Software

• Mathemagix
• gf2x

This page was built for publication: Implementing Fast Carryless Multiplication