Bit-parallel finite field multiplier and squarer using polynomial basis
From MaRDI portal
Recommendations
- Bit-Parallel Polynomial Basis Multiplier for New Classes of Finite Fields
- scientific article; zbMATH DE number 1504817
- Low complexity bit-parallel multipliers for a class of finite fields
- scientific article; zbMATH DE number 5504474
- New low-complexity bit-parallel finite field multipliers using weakly dual bases
- On low complexity bit parallel polynomial basis multipliers.
- scientific article; zbMATH DE number 1878331
- Efficient bit-parallel multipliers over finite fields GF(2ᵐ)
- Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
Cited in
(14)- High-performance hardware architecture of elliptic curve cryptography processor over \(\text{GF}(2^{163})\)
- Fast modular reduction and squaring in \(\mathrm{GF}(2^m)\)
- Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials
- Efficient systolic multiplications in composite fields for cryptographic systems
- On the arithmetic operations over finite fields of characteristic three with low complexity
- Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers
- scientific article; zbMATH DE number 1504817 (Why is no real title available?)
- New low-complexity bit-parallel finite field multipliers using weakly dual bases
- A three-term Karatsuba multiplier for a special class of trinomials
- Reduction-free multiplication for finite fields and polynomial rings
- FPGA-specific efficient designs of digit-serial multiplier for Galois field GF(2ᵐ)
- Polynomial basis multiplication over \(\text{GF}(2^m)\)
- An extension of TYT inversion algorithm in polynomial basis
This page was built for publication: Bit-parallel finite field multiplier and squarer using polynomial basis
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571282)
