The following pages link to (Q4418534):
Displaying 6 items.
- Complexity of computation in finite fields (Q378003) (← links)
- A new bit-serial multiplier over \(GF(pm)\) using irreducible trinomials (Q604106) (← links)
- Efficient hardware implementation of finite fields with applications to cryptography (Q850794) (← links)
- Highly efficient \(\mathrm{GF}(2^8)\) inversion circuit based on redundant GF arithmetic and its application to AES design (Q1695850) (← links)
- Faster Implementation of η T Pairing over GF(3 m ) Using Minimum Number of Logical Instructions for GF(3)-Addition (Q3600511) (← links)
- Efficient implementations of Gaussian elimination in finite fields on ASICs for MQ cryptographic systems (Q5031901) (← links)
