Low complexity bit-parallel multipliers for a class of finite fields
From MaRDI portal
Cited in
(18)- A HDL generator for flexible and efficient finite-field multipliers on FPGAs
- A Swan-like note for a family of binary pentanomials
- Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm
- scientific article; zbMATH DE number 5708383 (Why is no real title available?)
- Efficient Linear Array for Multiplication over NIST Recommended Binary Fields
- scientific article; zbMATH DE number 1504817 (Why is no real title available?)
- A low-complexity combinatorial RNS multiplier
- Derivation of Reduced Test Vectors for Bit-Parallel Multipliers over GF(2^m)
- Bit-parallel finite field multiplier and squarer using polynomial basis
- Look-up table-based large finite field multiplication in memory constrained cryptosystems
- New low-complexity bit-parallel finite field multipliers using weakly dual bases
- scientific article; zbMATH DE number 1878331 (Why is no real title available?)
- scientific article; zbMATH DE number 1424173 (Why is no real title available?)
- Efficient implementations of Gaussian elimination in finite fields on ASICs for MQ cryptographic systems
- Comments on "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Field"
- Fast Bit-Parallel Binary Multipliers Based on Type-I Pentanomials
- Low-cost addition-subtraction sequences for the final exponentiation in pairings
- Polynomial basis multiplication over \(\text{GF}(2^m)\)
This page was built for publication: Low complexity bit-parallel multipliers for a class of finite fields
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4571476)
