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. © de Gruyter 2010.
Author supplied keywords
Cite
CITATION STYLE
APA
Karabina, K., Menezes, A., Pomerance, C., & Shparlinski, I. E. (2010). On the asymptotic effectiveness of Weil descent attacks. Journal of Mathematical Cryptology, 4(2), 175–191. https://doi.org/10.1515/JMC.2010.007
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free