Bit-parallel systolic multipliers for GF(2/sup m/) fields defined by all-one and equally spaced polynomials

DOI10.1109/12.926154zbMath1391.94773OpenAlexW2144669042MaRDI QIDQ4571325

Jau-Yien Lee, Chiou-Yng Lee, Erl-Huei Lu

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

Mathematics Subject Classification ID

Cryptography (94A60) Mathematical problems of computer architecture (68M07) Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items (3)

AOP arithmetic architectures over GF(2\(^m\)) ⋮ Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial ⋮ Low-complexity multiplexer-based normal basis multiplier over \(GF(2^m)\)

This page was built for publication: Bit-parallel systolic multipliers for GF(2/sup m/) fields defined by all-one and equally spaced polynomials