Pages that link to "Item:Q1944906"
From MaRDI portal
The following pages link to Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials (Q1944906):
Displaying 4 items.
- Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials (Q963444) (← links)
- Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm (Q2445404) (← links)
- Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition (Q3600511) (← links)
- On the Complexity of Hybrid $n$ -Term Karatsuba Multiplier for Trinomials (Q5008364) (← links)
