CryptoDB
Solving Elliptic Curve Discrete Logarithm Problems Using Weil Descent
Authors: | |
---|---|
Download: | |
Abstract: | We provide a concrete instance of the discrete logarithm problem on an elliptic curve over F_{2^{155}} 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. |
BibTeX
@misc{eprint-2001-11453, title={Solving Elliptic Curve Discrete Logarithm Problems Using Weil Descent}, booktitle={IACR Eprint archive}, keywords={foundations / elliptic curve discrete logarithm problem, Weil descent}, url={http://eprint.iacr.org/2001/041}, note={ ajmeneze@uwaterloo.ca 11460 received 17 May 2001}, author={Michael Jacobson and Alfred Menezes and Andreas Stein}, year=2001 }