The following pages link to (Q4470462):
Displaying 9 items.
- Complexity of computation in finite fields (Q378003) (← links)
- Efficient hardware implementation of finite fields with applications to cryptography (Q850794) (← links)
- Algorithms for exponentiation in finite fields (Q1581128) (← links)
- Sparse polynomials, redundant bases, Gauss periods, and efficient exponentiation of primitive elements for small characteristic finite fields (Q2383972) (← links)
- A survey of some recent bit-parallel \(\mathrm{GF}(2^n)\) multipliers (Q2512883) (← links)
- Related-Key Attacks Against Full Hummingbird-2 (Q2946891) (← links)
- Irreducible trinomials over finite fields (Q4417173) (← links)
- Computing special powers in finite fields (Q4813594) (← links)
- IMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATION (Q5151088) (← links)
