On the asymptotic effectiveness of Weil descent attacks

Abstract

Abstract. In this paper we investigate the asymptotic effectiveness of the GaudryHess-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.