Improved Polynomial Multiplication Formulas over $IF₂$ Using Chinese Remainder Theorem
From MaRDI portal
Publication:4974987
DOI10.1109/TC.2008.207zbMath1367.11083MaRDI 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
68Q25: Analysis of algorithms and problem complexity
68W30: Symbolic computation and algebraic computation
11T06: Polynomials over finite fields
65Y04: Numerical algorithms for computer arithmetic, etc.
Related Items
Impact of Intel's new instruction sets on software implementation of \(GF(2)[x\) multiplication], Multiplication of polynomials modulo \(x^n\), Efficient multiplications in \(\mathbb F_5^{5n}\) and \(\mathbb F_7^{7n}\), On multiplication in finite fields, On the tensor rank of multiplication in any extension of \(\mathbb F_2\), A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers, On the construction of elliptic Chudnovsky-type algorithms for multiplication in large extensions of finite fields, Finding Optimal Chudnovsky-Chudnovsky Multiplication Algorithms, Efficient Multiplication in $\mathbb{F}_{3^{\ell m}}$ , m ≥ 1 and 5 ≤ ℓ ≤ 18