Pages that link to "Item:Q4571306"
From MaRDI portal
The following pages link to On the inherent space complexity of fast parallel multipliers for GF(2/sup m/) (Q4571306):
Displaying 4 items.
- Low-complexity multiplexer-based normal basis multiplier over \(GF(2^m)\) (Q1048342) (← links)
- Nearly logarithmic-time parallel algorithms for the class of \(\pm 2^ b\) ASCEND computations on a SIMD hypercube (Q1325982) (← links)
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers (Q2512883) (← links)
- Some Observations on Parallel Algorithms for Fast Exponentiation in $\operatorname{GF}(2^n)$ (Q3474890) (← links)
