The following pages link to (Q4797793):
Displaying 14 items.
- Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials (Q963444) (← links)
- Structure of parallel multipliers for a class of fields \(GF(2^ m)\) (Q1124585) (← links)
- Low-complexity versatile finite field multiplier in normal basis (Q1773590) (← links)
- Parallel \(\mathrm{GF}(3^m)\) multiplier for trinomials (Q1943625) (← links)
- Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials (Q2413208) (← links)
- Efficient reconfigurable implementation of canonical and normal basis multipliers over Galois fields GF \((2^{m})\) generated by AOPs (Q2432149) (← links)
- Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm (Q2445404) (← links)
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers (Q2512883) (← links)
- (Q4502795) (← links)
- Bit-parallel finite field multiplier and squarer using polynomial basis (Q4571282) (← links)
- Look-up table-based large finite field multiplication in memory constrained cryptosystems (Q4571367) (← links)
- New low-complexity bit-parallel finite field multipliers using weakly dual bases (Q4571485) (← links)
- (Q4945370) (← links)
- Comments on "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Field" (Q5280743) (← links)
