Comments on "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Field"

DOI10.1109/TC.2010.46zbMath1368.68036MaRDI QIDQ5280743

Gang Zhou, Harald Michalik

Publication date: 27 July 2017

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

Mathematics Subject Classification ID

Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Mathematical problems of computer architecture (68M07) Numerical algorithms for computer arithmetic, etc. (65Y04)

Related Items (2)

A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers ⋮ On the arithmetic operations over finite fields of characteristic three with low complexity

This page was built for publication: Comments on "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Field"