论文信息 - Improvement of ThéLeriault Algorithm of Index Calculus for Jacobian of Hyperelliptic Curves of Small Genus

Improvement of ThéLeriault Algorithm of Index Calculus for Jacobian of Hyperelliptic Curves of Small Genus

Gaudry present a variation of index calculus attack for solving the DLP in the Jacobian of hyperelliptic curves. Harley and Therialut improve these kind of algorithm. Here, we will present a variation of these kind of algorithm, which is faster than previous ones.

Koh-ichi Nagao | K. Nagao

[1] Douglas H. Wiedemann. Solving sparse linear equations over finite fields , 1986, IEEE Trans. Inf. Theory.

[2] PalaiseauDeutschland Franceenge. A General Framework for Subexponential Discrete Logarithm Algorithms , 2000 .

[3] P. Gaudry,et al. A general framework for subexponential discrete logarithm algorithms , 2002 .

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

[5] Andrew M. Odlyzko,et al. Solving Large Sparse Linear Systems over Finite Fields , 1990, CRYPTO.

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