eprint.iacr.org will be offline for approximately an hour
for routine maintenance at 11pm UTC on Tuesday, April 16. We lost some data between
April 12 and April 14, and some authors have been notified that they need to resubmit their papers.
You are looking at a specific version 20010520:170217 of this paper.
See the latest version.
Paper 2001/041
Solving Elliptic Curve Discrete Logarithm Problems Using Weil Descent
Michael Jacobson and Alfred Menezes and Andreas Stein
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.
Metadata
- Available format(s)
-
PDF
PS
- Category
- Foundations
- Publication info
- Published elsewhere. Unknown where it was published
- Keywords
- elliptic curve discrete logarithm problemWeil descent
- Contact author(s)
- ajmeneze @ uwaterloo ca
- History
- 2001-05-20: received
- Short URL
- https://ia.cr/2001/041
- License
-
CC BY
