Abstract Views :120 |
PDF Views:0
Authors
Affiliations
1 University of Manitoba, CA
2 Certicom Research & University of Waterloo, CA
3 University of Illinois at Urbana-Champaign
Department of Mathematics, 1409 West Green Street Urbana, Illinois 61801, US
Source
Journal of the Ramanujan Mathematical Society, Vol 16, No 3 (2001), Pagination: 231-260
Abstract
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.
