On the asymptotic effectiveness of Weil descent attacks

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.

[1]  Alfred Menezes,et al.  Analysis of the GHS Weil Descent Attack on the ECDLP over Characteristic Two Finite Fields of Composite Degree , 2001, INDOCRYPT.

[2]  Alfred Menezes,et al.  Cryptographic implications of Hess' generalized GHS attack , 2005, Applicable Algebra in Engineering, Communication and Computing.

[3]  J. Pollard,et al.  Monte Carlo methods for index computation () , 1978 .

[4]  F. Hess,et al.  Advances in Elliptic Curve Cryptography: Weil Descent Attacks , 2005 .

[5]  H. W. Lenstra,et al.  Factoring integers with elliptic curves , 1987 .

[6]  F. Hess.  Generalising the GHS attack on the elliptic curve discrete logarithm problem , 2004 .

[7]  Alfred Menezes,et al.  Reducing elliptic curve logarithms to logarithms in a finite field , 1991, STOC '91.

[8]  P. Erdos,et al.  Carmichael's lambda function , 1991 .

[9]  Steven D. Galbraith,et al.  Extending the GHS Weil Descent Attack , 2002, EUROCRYPT.

[10]  Pierrick Gaudry,et al.  An L ( 1 / 3 + ε ) Algorithm for the Discrete Logarithm Problem for Low Degree Curves , 2007 .

[11]  Ian F. Blake,et al.  Advances in Elliptic Curve Cryptography: Preface , 2005 .

[12]  Claus Diem.  On the discrete logarithm problem in class groups of curves , 2011, Math. Comput..

[13]  Harald Niederreiter,et al.  Introduction to finite fields and their applications: Preface , 1994 .

[14]  Joseph H. Silverman,et al.  The arithmetic of elliptic curves , 1986, Graduate texts in mathematics.

[15]  Takakazu Satoh,et al.  Fermat quotients and the polynomial time discrete log algorithm for anomalous elliptic curves , 1998 .

[16]  Nigel P. Smart,et al.  Constructive and destructive facets of Weil descent on elliptic curves , 2002, Journal of Cryptology.

[17]  Igor A. Semaev,et al.  Evaluation of discrete logarithms in a group of p-torsion points of an elliptic curve in characteristic p , 1998, Math. Comput..

[18]  H. Iwaniec,et al.  Analytic Number Theory , 2004 .

[19]  C. Diem.  On the discrete logarithm problem in elliptic curves , 2010, Compositio Mathematica.

[20]  G. Frey,et al.  A remark concerning m -divisibility and the discrete logarithm in the divisor class group of curves , 1994 .

[21]  Tatsuaki Okamoto.  Topics in Cryptology – CT-RSA 2004 , 2004, Lecture Notes in Computer Science.

[22]  Nigel P. Smart,et al.  The Discrete Logarithm Problem on Elliptic Curves of Trace One , 1999, Journal of Cryptology.

[23]  Pierrick Gaudry,et al.  An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves , 2000, EUROCRYPT.

[24]  Tanja Lange,et al.  Handbook of Elliptic and Hyperelliptic Curve Cryptography , 2005 .

[25]  Alfred Menezes,et al.  Weak Fields for ECC , 2004, CT-RSA.