Low complexity bit-parallel finite field arithmetic using polynomial basis
From MaRDI portal
Recommendations
- Bit-parallel finite field multiplier and squarer using polynomial basis
- Bit-Parallel Polynomial Basis Multiplier for New Classes of Finite Fields
- Low complexity bit-parallel multipliers for a class of finite fields
- On low complexity bit parallel polynomial basis multipliers.
- scientific article; zbMATH DE number 5504474
- scientific article; zbMATH DE number 1878331
- Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
- New low-complexity bit-parallel finite field multipliers using weakly dual bases
- Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials
Cited in
(8)- Parallel Itoh-Tsujii multiplicative inversion algorithm for a special class of trinomials
- On complexity of polynomial basis squaring in \(\mathbb{F}_{2^m}\)
- Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity
- Subquadratic Polynomial Multiplication over GF(2 m ) Using Trinomial Bases and Chinese Remaindering
- Highly regular architectures for finite field computation using redundant basis
- Bit-parallel finite field multiplier and squarer using polynomial basis
- New low-complexity bit-parallel finite field multipliers using weakly dual bases
- Reduction-free multiplication for finite fields and polynomial rings
This page was built for publication: Low complexity bit-parallel finite field arithmetic using polynomial basis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4502795)
