Fast Bit Parallel-Shifted Polynomial Basis Multipliers in <formula formulatype="inline"><tex>$GF(2^{n})$</tex></formula>

DOI10.1109/TCSI.2006.883855zbMath1374.11091OpenAlexW2094812471MaRDI QIDQ4590517

Haining Fan, M. Anwarul Hasan

Publication date: 20 November 2017

Published in: IEEE Transactions on Circuits and Systems I: Regular Papers (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/tcsi.2006.883855

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Mathematical problems of computer architecture (68M07) Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items

Efficient multiplier based on hybrid approach for Toeplitz matrix-vector product ⋮ Reduction-free multiplication for finite fields and polynomial rings ⋮ Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials ⋮ Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers ⋮ A three-term Karatsuba multiplier for a special class of trinomials

This page was built for publication: Fast Bit Parallel-Shifted Polynomial Basis Multipliers in &lt;formula formulatype="inline"&gt;&lt;tex&gt;$GF(2^{n})$&lt;/tex&gt;&lt;/formula&gt;