Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae

DOI10.1109/TC.2007.1024zbMath1284.11162OpenAlexW2132902317MaRDI QIDQ3525130

Haining Fan, M. Anwarul Hasan

Publication date: 10 September 2008

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tc.2007.1024

zbMATH Keywords

finite fieldKaratsuba algorithmpolynomial multiplication

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Error analysis and interval analysis (65G99)

Related Items (7)

Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18 ⋮ Impact of Intel's new instruction sets on software implementation of \(GF(2)[x\) multiplication] ⋮ Efficient multiplications in \(\mathbb F_5^{5n}\) and \(\mathbb F_7^{7n}\) ⋮ Optimal Karatsuba-like formulae for certain bilinear forms in GF(2) ⋮ On multiplication in finite fields ⋮ Multiplication of polynomials modulo \(x^n\) ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers

This page was built for publication: Comments on "Five, Six, and Seven-Term Karatsuba-Like Formulae