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

DOI10.1109/12.990131MaRDI QIDQ4571306zbMATH OpenOpenAlexFDO

Authors Michele Elia, M. Leone

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

Numerical algorithms for computer arithmetic, etc. (65Y04) Mathematical problems of computer architecture (68M07) Analysis of algorithms and problem complexity (68Q25)

Cited in

(4)

• Low-complexity multiplexer-based normal basis multiplier over GF(2ᵐ)
• Nearly logarithmic-time parallel algorithms for the class of \(\pm 2^ b\) ASCEND computations on a SIMD hypercube
• A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
• Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$

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

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