Pages that link to "Item:Q2445404"
From MaRDI portal
The following pages link to Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm (Q2445404):
Displaying 5 items.
- Parallel multiplication in \(\text{GF}(2^k)\) using polynomial residue arithmetic (Q1580541) (← links)
- AOP arithmetic architectures over GF(2\(^m\)) (Q1888264) (← 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)
- Computational Science and Its Applications – ICCSA 2004 (Q5712510) (← links)
