On low complexity bit parallel polynomial basis multipliers.
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1980961
- Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
- scientific article; zbMATH DE number 1878331
- Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials
- Efficient bit-parallel multipliers over finite fields GF(2ᵐ)
Cited in
(15)- Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial
- 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
- \(\text{GF}(2^m)\) finite-field multipliers with reduced activity variations
- Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields
- Parallel multipliers based on special irreducible pentanomials
- scientific article; zbMATH DE number 1979306 (Why is no real title available?)
- scientific article; zbMATH DE number 1980961 (Why is no real title available?)
- scientific article; zbMATH DE number 1504693 (Why is no real title available?)
- scientific article; zbMATH DE number 1504817 (Why is no real title available?)
- Bit-parallel finite field multiplier and squarer using polynomial basis
- Information Security and Cryptology - ICISC 2003
- On Computing Multilinear Polynomials Using Multi- r -ic Depth Four Circuits
- Efficient bit-parallel multipliers over finite fields GF(2ᵐ)
- Multiplexer-based bit-parallel systolic multipliers over GF(\(2^m)\)
This page was built for publication: On low complexity bit parallel polynomial basis multipliers.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5187954)
