Multiplication of polynomials modulo \(x^n\)

DOI10.1016/j.tcs.2011.02.031zbMath1216.68123OpenAlexW2037384341MaRDI QIDQ551166

Ferruh Özbudak, Murat Cenk

Publication date: 14 July 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.02.031

zbMATH Keywords

multiplicative complexitymultiplication of power seriesmultiplication algorithmsmultiplication of polynomials

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30)

Related Items

Finding Optimal Chudnovsky-Chudnovsky Multiplication Algorithms ⋮ A note on the paper ``Multiplication of polynomials modulo \(x^n\) by Murat Cenk and Ferruh Özbudak ⋮ Efficient multiplications in \(\mathbb F_5^{5n}\) and \(\mathbb F_7^{7n}\) ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers ⋮ On the tensor rank of multiplication in finite extensions of finite fields and related issues in algebraic geometry

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimal Karatsuba-like formulae for certain bilinear forms in GF(2)
• On multiplication in finite fields
• Classification of all the minimal bilinear algorithms for computing the coefficients of the product of two polynomials modulo a polynomial. II: The algebra \(G[u/\langle{} u^ n \rangle\)]
• Five, six, and seven-term Karatsuba-like formulae
• Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18
• Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae
• Multiplicative complexity of polynomial multiplication over finite fields
• Improved Polynomial Multiplication Formulas over $IF₂$ Using Chinese Remainder Theorem
• Algebraic complexities and algebraic curves over finite fields