On the inherent space complexity of fast parallel multipliers for GF(2/sup m/)

DOI10.1109/12.990131zbMath1391.94911OpenAlexW2058315999MaRDI QIDQ4571306

M. Leone, Michele Elia

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) 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 ⋮ Low-complexity multiplexer-based normal basis multiplier over \(GF(2^m)\)

This page was built for publication: On the inherent space complexity of fast parallel multipliers for GF(2/sup m/)