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

DOI10.1109/TC.2008.67MaRDI QIDQ4564055zbMATH OpenFDO

Authors Huapeng Wu

Publication date 12 June 2018

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

Full work available at URL https://doi.org/10.1109/TC.2008.67

Mathematics Subject Classification ID

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

Cited in

(9)

• 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
• Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity
• scientific article; zbMATH DE number 1504806 (Why is no real title available?)
• scientific article; zbMATH DE number 1504817 (Why is no real title available?)
• Bit-parallel finite field multiplier and squarer using polynomial basis
• New low-complexity bit-parallel finite field multipliers using weakly dual bases
• scientific article; zbMATH DE number 1878331 (Why is no real title available?)
• Comments on "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Field"

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4564055)