Bit-Parallel Polynomial Basis Multiplier for New Classes of Finite Fields

DOI10.1109/TC.2008.67zbMath1390.65199MaRDI QIDQ4564055

Huapeng Wu

Publication date: 12 June 2018

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

Mathematics Subject Classification ID

Polynomials over finite fields (11T06) Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items (2)

Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers

This page was built for publication: Bit-Parallel Polynomial Basis Multiplier for New Classes of Finite Fields