Solving Elliptic Curve Discrete Logarithm Problems Using Weil Descent.
Michael J. Jacobson, Alfred Menezes, Andreas Stein · 2001
We provide the first cryptographically interesting instance of the elliptic curve discrete logarithm problem which resists all previously known attacks, but which can be solved with modest computer resources using the Weil descent attack methodology of Frey. We report on our implementation of index-calculus methods for hyperelliptic curves over characteristic two finite fields, and discuss the cryptographic implications of our results. 1