Pages that link to "Item:Q3417003"
From MaRDI portal
The following pages link to An efficient optimal normal basis type II multiplier (Q3417003):
Displayed 13 items.
- Finding normal bases over finite fields with prescribed trace self-orthogonal relations (Q402533) (← links)
- Gauss periods as constructions of low complexity normal bases (Q663465) (← links)
- A Euclidean algorithm for normal bases (Q850785) (← links)
- Scalable and systolic architecture for computing double exponentiation over \(\text{GF}(2^m)\) (Q850793) (← links)
- An extension of TYT inversion algorithm in polynomial basis (Q991790) (← links)
- Low-complexity multiplexer-based normal basis multiplier over \(GF(2^m)\) (Q1048342) (← links)
- Finite field arithmetic using quasi-normal bases (Q2370646) (← links)
- Efficient reconfigurable implementation of canonical and normal basis multipliers over Galois fields GF \((2^{m})\) generated by AOPs (Q2432149) (← links)
- WG: a family of stream ciphers with designed randomness properties (Q2476897) (← links)
- Polynomial Evaluation and Side Channel Analysis (Q2803637) (← links)
- On a family of preimage-resistant functions (Q3075868) (← links)
- Digit-Serial Structures for the Shifted Polynomial Basis Multiplication over Binary Extension Fields (Q3519555) (← links)
- (Q5869338) (← links)