Modular construction of low complexity parallel multipliers for a class of finite fields GF(2/sup m/)

DOI10.1109/12.156539zbMath1397.65332OpenAlexW2111351274MaRDI QIDQ5375358

Muzhong Wang, Vijay K. Bhargava, M. Anwarul Hasan

Publication date: 14 September 2018

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

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

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Mathematical problems of computer architecture (68M07) Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items (3)

Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial ⋮ A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers ⋮ Low-complexity multiplexer-based normal basis multiplier over \(GF(2^m)\)

This page was built for publication: Modular construction of low complexity parallel multipliers for a class of finite fields GF(2/sup m/)