Pages that link to "Item:Q4420885"

The following pages link to A new architecture for a parallel finite field multiplier with low complexity based on composite fields (Q4420885):

Displaying 8 items.

• Finite field trigonometric transforms (Q429771) (← links)
• Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\) (Q850793) (← links)
• Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial (Q1944198) (← links)
• Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials (Q1944906) (← links)
• A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers (Q2512883) (← links)
• New low-complexity bit-parallel finite field multipliers using weakly dual bases (Q4571485) (← links)
• (Q4797793) (← links)
• Comments on "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Field" (Q5280743) (← links)