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

DOI10.1109/12.156539MaRDI QIDQ5375358zbMATH OpenOpenAlexFDO

Authors Muzhong Wang, Vijay K. Bhargava, M. Anwar 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

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

Cited in

(8)

• Low-complexity multiplexer-based normal basis multiplier over GF(2ᵐ)
• 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
• A Scalable Method for Constructing Galois NLFSRs With Period 2ⁿ-1 Using Cross-Join Pairs
• Efficient multiplier architectures for Galois fields GF(2/sup 4n/)
• 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"
• Computational Science and Its Applications – ICCSA 2004

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

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