Pages that link to "Item:Q963444"

The following pages link to Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials (Q963444):

Displaying 4 items.

• A new bit-serial multiplier over \(GF(pm)\) using irreducible trinomials (Q604106) (← links)
• Parallel multiplication in \(\text{GF}(2^k)\) using polynomial residue arithmetic (Q1580541) (← links)
• Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials (Q1944906) (← links)
• A three-term Karatsuba multiplier for a special class of trinomials (Q5865701) (← links)