Faster polynomial multiplication via multipoint Kronecker substitution

DOI10.1016/J.JSC.2009.05.004MaRDI QIDQ840717zbMATH OpenOpenAlexFDO

Authors 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 algorithmKronecker substitutionpolynomial multiplication

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30)

Recommendations

• scientific article; zbMATH DE number 5872171
• Faster polynomial multiplication over finite fields
• On fast multiplication of polynomials over arbitrary algebras
• Space- and time-efficient polynomial multiplication
• Algorithms – ESA 2004
• Faster polynomial multiplication via discrete Fourier transforms
• Efficient evaluation of multivariate polynomials
• Fast Multiplication for Skew Polynomials
• Very Fast Parallel Polynomial Arithmetic
• scientific article; zbMATH DE number 1254017

Cites work

• Computing L-Series of Hyperelliptic Curves
• Fast multiplication of polynomials over fields of characteristic 2
• Fast polynomial transform algorithms for digital convolution
• scientific article; zbMATH DE number 3856407 (Why is no real title available?)
• Irregular primes and cyclotomic invariants to 12 million
• Kedlaya's Algorithm in Larger Characteristic
• The Magma algebra system. I: The user language
• The truncated fourier transform and applications

Cited in

(16)

• On using RSA/ECC coprocessor for ideal lattice-based key exchange
• Saber on ESP32
• Space- and time-efficient polynomial multiplication
• Computing Hilbert class polynomials with the Chinese remainder theorem
• scientific article; zbMATH DE number 5872171 (Why is no real title available?)
• Irregular primes to 163 million
• A note on the paper ``Multiplication of polynomials modulo \(x^n\) by Murat Cenk and Ferruh Özbudak
• Computing isomorphisms and embeddings of finite fields
• Fast integer multiplication using generalized Fermat primes
• Fast Multiplication for Skew Polynomials
• Computation of Exact Bootstrap Confidence Intervals: Complexity and Deterministic Algorithms
• Modular polynomials via isogeny volcanoes
• Simultaneous modular reduction and Kronecker substitution for small finite fields
• Towards Optimal Toom-Cook Multiplication for Univariate and Multivariate Polynomials in Characteristic 2 and 0
• Dilithium for memory constrained devices
• Arithmetic terms for sums of multinomial coefficients

Describes a project that uses

Uses Software

• NTL
• Magma
• zn_poly
• gmp

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q840717)