Pages that link to "Item:Q605724"
From MaRDI portal
The following pages link to Efficient bit-parallel multipliers over finite fields GF\((2^m)\) (Q605724):
Displaying 22 items.
- Polynomial basis multiplication over \(\text{GF}(2^m)\) (Q850783) (← links)
- Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials (Q963444) (← links)
- Structure of parallel multipliers for a class of fields \(GF(2^ m)\) (Q1124585) (← links)
- Parallel multiplication in \(\text{GF}(2^k)\) using polynomial residue arithmetic (Q1580541) (← links)
- Parallel \(\mathrm{GF}(3^m)\) multiplier for trinomials (Q1943625) (← links)
- Faster multiplication in \(\mathbb{Z}_{2^m}[x]\) on Cortex-M4 to speed up NIST PQC candidates (Q2291393) (← links)
- Low complexity bit-parallel multiplier for \(\mathbb{F}_{2^n}\) defined by repeated polynomials (Q2413208) (← links)
- Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm (Q2445404) (← links)
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers (Q2512883) (← links)
- A Scalable Method for Constructing Galois NLFSRs With Period $2^n-1$ Using Cross-Join Pairs (Q2989498) (← links)
- Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition (Q3600511) (← links)
- Efficient Linear Array for Multiplication over NIST Recommended Binary Fields (Q3638334) (← links)
- (Q4408448) (← links)
- Derivation of Reduced Test Vectors for Bit-Parallel Multipliers over GF(2^m) (Q4564084) (← links)
- Bit-parallel finite field multiplier and squarer using polynomial basis (Q4571282) (← links)
- Look-up table-based large finite field multiplication in memory constrained cryptosystems (Q4571367) (← links)
- Efficient multiplier architectures for Galois fields GF(2/sup 4n/) (Q4571442) (← links)
- New low-complexity bit-parallel finite field multipliers using weakly dual bases (Q4571485) (← links)
- (Q4797793) (← links)
- Efficient implementations of Gaussian elimination in finite fields on ASICs for MQ cryptographic systems (Q5031901) (← links)
- Comments on "A New Architecture for a Parallel Finite Field Multiplier with Low Complexity Based on Composite Field" (Q5280743) (← links)
- Information Security and Cryptology - ICISC 2003 (Q5714120) (← links)
