The following pages link to (Q4364562):
Displaying 19 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)
- Optimal software-implemented Itoh-Tsujii inversion for \(\mathbb{F}_{2^{m}}\) (Q510481) (← 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)
- Secure and compact elliptic curve cryptosystems (Q2183954) (← links)
- Applying systolic multiplication-inversion architectures based on modified extended Euclidean algorithm for \(\text{GF}(2^k)\) in elliptic curve cryptography (Q2384546) (← links)
- An efficient threshold group signature scheme (Q2570718) (← links)
- Efficient algorithms for speeding up the computations of elliptic curve cryptosystems (Q2572747) (← 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)
- (Q3840102) (← links)
- (Q4343422) (← links)
- (Q4502489) (← links)
- Efficient elliptic curve cryptosystems (Q4626167) (← links)
- The double-base number system and its application to elliptic curve cryptography (Q5444319) (← links)
- New Composite Operations and Precomputation Scheme for Elliptic Curve Cryptosystems over Prime Fields (Q5445456) (← links)
- Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. (Q5944106) (← links)
