New low-complexity bit-parallel finite field multipliers using weakly dual bases

DOI10.1109/12.736433zbMath1391.94816OpenAlexW2096013791MaRDI QIDQ4571485

Huapeng Wu, Ian F. Blake, M. Anwarul Hasan

Publication date: 9 July 2018

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

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

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Mathematical problems of computer architecture (68M07) Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items (4)

Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial ⋮ Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields ⋮ Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers

This page was built for publication: New low-complexity bit-parallel finite field multipliers using weakly dual bases