Pages that link to "Item:Q2765411"
From MaRDI portal
The following pages link to Solving elliptic curve discrete logarithm problems using Weil descent (Q2765411):
Displaying 14 items.
- Constructive and destructive facets of Weil descent on elliptic curves (Q1596367) (← links)
- Solving a 112-bit prime elliptic curve discrete logarithm problem on game consoles using sloppy reduction (Q1758892) (← links)
- Extending the GLS endomorphism to speed up GHS Weil descent using Magma (Q1979955) (← links)
- An elliptic curve trapdoor system (Q2499265) (← links)
- Cryptographic implications of Hess' generalized GHS attack (Q2502169) (← links)
- Smoothness testing of polynomials over finite fields (Q2513763) (← links)
- Limitations of constructive Weil descent (Q2764233) (← links)
- Computing discrete logarithms in the Jacobian of high-genus hyperelliptic curves over even characteristic finite fields (Q2871193) (← links)
- Solving a Discrete Logarithm Problem with Auxiliary Input on a 160-Bit Elliptic Curve (Q2900246) (← links)
- On implementation of GHS attack against elliptic curve cryptosystems over cubic extension fields of odd characteristic (Q4635408) (← links)
- On Polynomial Systems Arising from a Weil Descent (Q4911601) (← links)
- Algebraic curves and cryptography (Q5921638) (← links)
- Cover attacks for elliptic curves over cubic extension fields (Q6176272) (← links)
- Exp function for Edwards curves over local fields (Q6605881) (← links)
