Index Calculus Attack for Hyperelliptic Curves of Small Genus

  • Nicolas Thériault
Conference paper

DOI: 10.1007/978-3-540-40061-5_5

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2894)
Cite this paper as:
Thériault N. (2003) Index Calculus Attack for Hyperelliptic Curves of Small Genus. In: Laih CS. (eds) Advances in Cryptology - ASIACRYPT 2003. ASIACRYPT 2003. Lecture Notes in Computer Science, vol 2894. Springer, Berlin, Heidelberg

Abstract

We present a variation of the index calculus attack by Gaudry which can be used to solve the discrete logarithm problem in the Jacobian of hyperelliptic curves. The new algorithm has a running time which is better than the original index calculus attack and the Rho method (and other square-root algorithms) for curves of genus ≥ 3. We also describe another improvement for curves of genus ≥ 4 (slightly slower, but less dependent on memory space) initially mentioned by Harley and used in a number of papers, but never analyzed in details.

Download to read the full conference paper text

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Nicolas Thériault
    • 1
  1. 1.University of Toronto 

Personalised recommendations