The following pages link to (Q4536202):
Displayed 10 items.
- Complexity of computation in finite fields (Q378003) (← links)
- An extension of TYT algorithm for \(GF((2^n)^m)\) using precomputation (Q834951) (← links)
- Efficient software-implementation of finite fields with applications to cryptography (Q850780) (← links)
- An extension of TYT inversion algorithm in polynomial basis (Q991790) (← links)
- Random small Hamming weight products with applications to cryptography (Q1408370) (← links)
- Koblitz curve cryptosystems (Q1779327) (← links)
- Methods for Increasing the Resistance of Cryptographic Designs Against Horizontal DPA Attacks (Q3297502) (← links)
- Enhanced Digital Signature Using RNS Digit Exponent Representation (Q5267801) (← links)
- The double-base number system and its application to elliptic curve cryptography (Q5444319) (← links)
- On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography (Q5503300) (← links)