Abstract
In this paper we investigate the asymptotic effectiveness of the Gaudry-Hess-Smart Weil descent attack and its generalization to the discrete logarithm problem for elliptic curves over characteristic-two finite fields. In particular we obtain nontrivial lower and upper bounds on the smallest possible genus to which it can lead.
Original language | English |
---|---|
Pages (from-to) | 175-191 |
Number of pages | 17 |
Journal | Journal of Mathematical Cryptology |
Volume | 4 |
Issue number | 2 |
DOIs | |
Publication status | Published - Oct 2010 |
Externally published | Yes |