Pages that link to "Item:Q3417022"
From MaRDI portal
The following pages link to A new construction of Massey-Omura parallel multiplier over GF(2/sup m/) (Q3417022):
Displaying 8 items.
- Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\) (Q850793) (← links)
- Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials (Q963444) (← links)
- An extension of TYT inversion algorithm in polynomial basis (Q991790) (← links)
- Low-complexity multiplexer-based normal basis multiplier over \(GF(2^m)\) (Q1048342) (← links)
- Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial (Q1944198) (← links)
- Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm (Q2445404) (← links)
- WG: a family of stream ciphers with designed randomness properties (Q2476897) (← links)
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers (Q2512883) (← links)