Efficient Bit-Parallel GF(2^m) Multiplier for a Large Class of Irreducible Pentanomials

DOI10.1109/TC.2009.16zbMath1367.65252OpenAlexW2076886298MaRDI QIDQ4974938

Alessandro Cilardo

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.2009.16

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Polynomials over finite fields (11T06)

Related Items (2)

A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers ⋮ Using arced axes in parallel coordinates geometry for high dimensional bigdata visual analytics in cloud computing

This page was built for publication: Efficient Bit-Parallel GF(2^m) Multiplier for a Large Class of Irreducible Pentanomials