Pages that link to "Item:Q4564229"
From MaRDI portal
The following pages link to Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases (Q4564229):
Displaying 6 items.
- Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials (Q1944906) (← links)
- Efficient normal basis multipliers in composite fields (Q3417051) (← links)
- Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation (Q3519554) (← links)
- Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering (Q3644213) (← links)
- Direct hardware solution to quadratic equation Z2⊕Z⊕β=0 in Galois fields based on normal basis representation (Q4206835) (← links)
- Improved Area-Time Tradeoffs for Field Multiplication Using Optimal Normal Bases (Q5274284) (← links)
