Pages that link to "Item:Q2413208"
From MaRDI portal
The following pages link to Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials (Q2413208):
Displaying 5 items.
- Parallel multiplication in \(\text{GF}(2^k)\) using polynomial residue arithmetic (Q1580541) (← links)
- (Q4443244) (← links)
- (Q4502795) (← links)
- Derivation of Reduced Test Vectors for Bit-Parallel Multipliers over GF(2^m) (Q4564084) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5307201) (← links)