Improved Polynomial Multiplication Formulas over $IF₂$ Using Chinese Remainder Theorem
From MaRDI portal
Publication:4974987
DOI10.1109/TC.2008.207zbMath1367.11083OpenAlexW2132571841MaRDI QIDQ4974987
Publication date: 8 August 2017
Published in: IEEE Transactions on Computers (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1109/tc.2008.207
Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Polynomials over finite fields (11T06) Numerical algorithms for computer arithmetic, etc. (65Y04)
Related Items (9)
Finding Optimal Chudnovsky-Chudnovsky Multiplication Algorithms ⋮ Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18 ⋮ On the tensor rank of multiplication in any extension of \(\mathbb F_2\) ⋮ 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}\) ⋮ On multiplication in finite fields ⋮ Multiplication of polynomials modulo \(x^n\) ⋮ On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
This page was built for publication: Improved Polynomial Multiplication Formulas over $IF₂$ Using Chinese Remainder Theorem
