Pages that link to "Item:Q1048342"
From MaRDI portal
The following pages link to Low-complexity multiplexer-based normal basis multiplier over \(GF(2^m)\) (Q1048342):
Displaying 3 items.
- Low-complexity versatile finite field multiplier in normal basis (Q1773590) (← links)
- Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial (Q1944198) (← links)
- Low-complexity bit-parallel dual basis multipliers using the modified Booth's algorithm (Q2507343) (← links)