Pages that link to "Item:Q1944198"
From MaRDI portal
The following pages link to Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial (Q1944198):
Displaying 3 items.
- Low-complexity multiplexer-based normal basis multiplier over \(GF(2^m)\) (Q1048342) (← links)
- Efficient multiplier based on hybrid approach for Toeplitz matrix-vector product (Q1685022) (← links)
- Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm (Q2445404) (← links)
