**Elliptic Curve Discrete Logarithm Problem over Small Degree Extension Fields. Application to the static Diffie-Hellman problem on $E(\F_{q^5})$**

*Antoine Joux and Vanessa Vitse*

**Abstract: **In 2008 and 2009, Gaudry and Diem proposed an index calculus method for the resolution of the discrete logarithm on the group of points of an elliptic curve defined over a small degree extension field $\F_{q^n}$. In this paper, we study a variation of this index calculus method, improving the overall asymptotic complexity when $\log q \leq c n^3$. In particular, we are able to successfully obtain relations on $E(\F_{p^5})$, whereas the more expensive computational complexity of Gaudry and Diem's initial algorithm makes it impractical in this case. An important ingredient of this result is a new variation of Faugère's Gröbner basis algorithm F4, which significantly speeds up the relation computation and might be of independent interest. As an application, we show how this index calculus leads to a practical example of an oracle-assisted resolution of the elliptic curve static Diffie-Hellman problem over a finite field on $130$ bits, which is faster than birthday-based discrete logarithm computations on the same curve.

**Category / Keywords: **elliptic curve, discrete logarithm problem (DLP), index calculus, Gröbner basis computation, summation polynomials, static Diffie-Hellman problem (SDHP)

**Date: **received 24 Mar 2010, last revised 24 Mar 2010

**Contact author: **vanessa vitse at prism uvsq fr

**Available format(s): **PDF | BibTeX Citation

**Version: **20100324:154133 (All versions of this report)

**Short URL: **ia.cr/2010/157

**Discussion forum: **Show discussion | Start new discussion

[ Cryptology ePrint archive ]