Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases
From MaRDI portal
Recommendations
- A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields
- Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation
- Improved Area-Time Tradeoffs for Field Multiplication Using Optimal Normal Bases
- Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
- Low-complexity versatile finite field multiplier in normal basis
- Subquadratic-time algorithms for normal bases
- Efficient normal basis multipliers in composite fields
- Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation
- EFFICIENT PARALLEL GAUSSIAN NORMAL BASES MULTIPLIERS OVER FINITE FIELDS
Cited in
(6)- Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials
- Efficient normal basis multipliers in composite fields
- Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation
- Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering
- Direct hardware solution to quadratic equation Z2⊕Z⊕β=0 in Galois fields based on normal basis representation
- Improved Area-Time Tradeoffs for Field Multiplication Using Optimal Normal Bases
This page was built for publication: Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4564229)
