Pages that link to "Item:Q963444"
From MaRDI portal
The following pages link to Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials (Q963444):
Displaying 14 items.
- A new bit-serial multiplier over \(GF(pm)\) using irreducible trinomials (Q604106) (← links)
- Efficient bit-parallel multipliers over finite fields GF\((2^m)\) (Q605724) (← links)
- More efficient systolic arrays for multiplication in GF\((2^m)\) using LSB first algorithm with irreducible polynomials and trinomials (Q1013353) (← links)
- Parallel multiplication in \(\text{GF}(2^k)\) using polynomial residue arithmetic (Q1580541) (← links)
- Efficient multiplier based on hybrid approach for Toeplitz matrix-vector product (Q1685022) (← links)
- Parallel \(\mathrm{GF}(3^m)\) multiplier for trinomials (Q1943625) (← links)
- Speedup of bit-parallel Karatsuba multiplier in \(\mathrm{GF}(m^2)\) generated by trinomials (Q1944906) (← links)
- Low-complexity bit-parallel dual basis multipliers using the modified Booth's algorithm (Q2507343) (← links)
- Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition (Q3600511) (← links)
- Derivation of Reduced Test Vectors for Bit-Parallel Multipliers over GF(2^m) (Q4564084) (← links)
- Computational Science and Its Applications – ICCSA 2004 (Q5307201) (← links)
- Fast Bit-Parallel Binary Multipliers Based on Type-I Pentanomials (Q5375293) (← links)
- Information Security and Cryptology - ICISC 2003 (Q5714120) (← links)
- A three-term Karatsuba multiplier for a special class of trinomials (Q5865701) (← links)
