Pages that link to "Item:Q4571485"

The following pages link to New low-complexity bit-parallel finite field multipliers using weakly dual bases (Q4571485):

Displaying 9 items.

• Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials (Q963444) (← links)
• Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial (Q1944198) (← links)
• A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers (Q2512883) (← links)
• Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields (Q3519555) (← links)
• (Q4502775) (← links)
• (Q4502795) (← links)
• Bit-parallel finite field multiplier and squarer using polynomial basis (Q4571282) (← links)
• (Q4797793) (← links)
• Comments on "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Field" (Q5280743) (← links)