Faster polynomial multiplication via multipoint Kronecker substitution

DOI10.1016/j.jsc.2009.05.004zbMath1194.68265OpenAlexW1482543270MaRDI QIDQ840717

David I. Harvey

Publication date: 14 September 2009

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

Full work available at URL: https://doi.org/10.1016/j.jsc.2009.05.004

zbMATH Keywords

efficient algorithmpolynomial multiplicationKronecker substitution

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Related Items (10)

On using RSA/ECC coprocessor for ideal lattice-based key exchange ⋮ Dilithium for memory constrained devices ⋮ Computing isomorphisms and embeddings of finite fields ⋮ Fast integer multiplication using generalized Fermat primes ⋮ Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms ⋮ Modular polynomials via isogeny volcanoes ⋮ Saber on ESP32 ⋮ Simultaneous modular reduction and Kronecker substitution for small finite fields ⋮ Computing Hilbert class polynomials with the Chinese remainder theorem ⋮ Irregular primes to 163 million

Uses Software

• gmp
• Magma
• NTL
• zn_poly

Cites Work

• Unnamed Item
• Fast multiplication of polynomials over fields of characteristic 2
• The Magma algebra system. I: The user language
• Fast polynomial transform algorithms for digital convolution
• The truncated fourier transform and applications
• Computing L-Series of Hyperelliptic Curves
• Kedlaya's Algorithm in Larger Characteristic
• Irregular primes and cyclotomic invariants to 12 million

This page was built for publication: Faster polynomial multiplication via multipoint Kronecker substitution