Weil Descent Attack for Artin-Schreier Curves

In this paper, we show how the method introduced by Gaudry, Hess and Smart can be extended to a family of algebraic curves using Artin-Schreier extensions. This family also extends the number of hyperelliptic curves in characteristic 2 vulnarable to the Weil decent attack obtained by Galbraith. We also show that the genus of the resulting curve will be one of two easily computable values.

[1]  Alfred Menezes,et al.  Solving Elliptic Curve Discrete Logarithm Problems Using Weil Descent , 2001, IACR Cryptol. ePrint Arch..

[2]  Andreas Enge,et al.  Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time , 2002, Math. Comput..

[3]  Steven D. Galbraith,et al.  A Cryptographic Application of Weil Descent , 1999, IMACC.

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

[5]  J. Neukirch.  Algebraic Number Theory , 1999 .

[6]  N. Thériault.  Weil descent attack for Kummer extensions , 2003 .

[7]  Nigel P. Smart,et al.  How Secure Are Elliptic Curves over Composite Extension Fields? , 2001, EUROCRYPT.

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

[9]  Seigo Arita,et al.  Weil Descent of Elliptic Curves over Finite Fields of Characteristic Three , 2000, ASIACRYPT.

[10]  Leonard M. Adleman,et al.  A Subexponential Algorithm for Discrete Logarithms over Hyperelliptic Curves of Large Genus over GF(q) , 1999, Theor. Comput. Sci..

[11]  Gadiel Seroussi,et al.  Two Topics in Hyperelliptic Cryptography , 2001, Selected Areas in Cryptography.

[12]  G. Frey.  Applications of Arithmetical Geometry to Cryptographic Constructions , 2001 .

[13]  Steven D. Galbraith.  Limitations of constructive Weil descent , 2001 .

[14]  Alfred Menezes,et al.  Analysis of the Weil Descent Attack of Gaudry, Hess and Smart , 2001, CT-RSA.

[15]  C. Diem.  The GHS-attack in odd characteristic , 2003 .

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

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

[18]  Andreas Stein,et al.  Computing discrete logarithms in real quadratic congruence function fields of large genus , 1999, Math. Comput..

[19]  Steven D. Galbraith,et al.  Weil Descent of Jacobians , 2001, Discret. Appl. Math..

[20]  Nicolas Thériault,et al.  Index Calculus Attack for Hyperelliptic Curves of Small Genus , 2003, ASIACRYPT.

[21]  Henning Stichtenoth,et al.  Algebraic function fields and codes , 1993, Universitext.

[22]  Daniel Panario,et al.  The index calculus method using non-smooth polynomials , 2001, Math. Comput..