Pages that link to "Item:Q3417016"
From MaRDI portal
The following pages link to Low-complexity bit-parallel canonical and normal basis multipliers for a class of finite fields (Q3417016):
Displaying 13 items.
- A Euclidean algorithm for normal bases (Q850785) (← links)
- Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\) (Q850793) (← links)
- Programmable cellular automata based Montgomery hardware architecture (Q876683) (← links)
- Low complexity bit parallel multiplier for \(GF(2^m)\) generated by equally-spaced trinomials (Q963444) (← links)
- An extension of TYT inversion algorithm in polynomial basis (Q991790) (← links)
- Montgomery exponent architecture based on programmable cellular automata (Q1010043) (← links)
- Low-complexity multiplexer-based normal basis multiplier over \(GF(2^m)\) (Q1048342) (← links)
- Multiplexer implementation of low-complexity polynomial basis multiplier in \(\mathrm{GF}(2^m)\) using all one polynomial (Q1944198) (← links)
- Efficient reconfigurable implementation of canonical and normal basis multipliers over Galois fields GF \((2^{m})\) generated by AOPs (Q2432149) (← links)
- Novel bit-parallel multiplier for \(\mathrm{GF}(2^m)\) defined by all-one polynomial using generalized Karatsuba algorithm (Q2445404) (← links)
- A novel approach for bit-serial \(AB^{2}\) multiplication in finite fields \(\mathrm{GF}(2^m)\) (Q2475900) (← links)
- Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields (Q3519555) (← links)
- A Versatile Reconfigurable Bit-Serial Multiplier Architecture in Finite Fields GF(2m) (Q3628444) (← links)
