The following pages link to (Q4364562):
Displayed 9 items.
- A fast addition algorithm for elliptic curve arithmetic in \(\mathrm{GF}(2^{n})\) using projective coordinates (Q294862) (← links)
- Extended elliptic curve Montgomery ladder algorithm over binary fields with resistance to simple power analysis (Q497571) (← links)
- An extension of TYT algorithm for \(GF((2^n)^m)\) using precomputation (Q834951) (← links)
- Efficient hardware implementation of finite fields with applications to cryptography (Q850794) (← links)
- Optimal Karatsuba-like formulae for certain bilinear forms in GF(2) (Q947669) (← links)
- An efficient threshold group signature scheme (Q2570718) (← links)
- Higher-Order Masking in Practice: A Vector Implementation of Masked AES for ARM NEON (Q2790039) (← links)
- MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity (Q2958119) (← links)
- The double-base number system and its application to elliptic curve cryptography (Q5444319) (← links)