Pages that link to "Item:Q2806768"
From MaRDI portal
The following pages link to Point Decomposition Problem in Binary Elliptic Curves (Q2806768):
Displaying 19 items.
- Low-cost addition-subtraction sequences for the final exponentiation in pairings (Q740296) (← links)
- Recent progress on the elliptic curve discrete logarithm problem (Q908041) (← links)
- The point decomposition problem over hyperelliptic curves, Toward efficient computation of discrete logarithms in even characteristic (Q1671640) (← links)
- Choosing and generating parameters for pairing implementation on BN curves (Q1745896) (← links)
- Updating key size estimations for pairings (Q2010589) (← links)
- Families of SNARK-friendly 2-chains of elliptic curves (Q2170053) (← links)
- Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation (Q2182074) (← links)
- Improving the computation of the optimal ate pairing for a high security level (Q2317387) (← links)
- Koblitz curves over quadratic fields (Q2318090) (← links)
- Faster Hashing to ${\mathbb G}_2$ (Q2889888) (← links)
- (Q3781267) (← links)
- (Q4911916) (redirect page) (← links)
- (Q5414475) (← links)
- An Analysis of the Vector Decomposition Problem (Q5445460) (← links)
- A survey of elliptic curves for proof systems (Q6063127) (← links)
- Fast subgroup membership testings for \(\mathbb{G}_1, \mathbb{G}_2\) and \(\mathbb{G}_T\) on pairing-friendly curves (Q6074017) (← links)
- Secure and Efficient Pairing at 256-Bit Security Level (Q6487201) (← links)
- Optimized and Secure Pairing-Friendly Elliptic Curves Suitable for One Layer Proof Composition (Q6488029) (← links)
- Pairings in rank-1 constraint systems (Q6535081) (← links)
