L. M. Adleman, J. Demarrais, and M. Huang, A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields, ANTS-I Lecture Notes in Comput. Sci, vol.877, pp.28-40, 1994.
DOI : 10.1007/3-540-58691-1_39

A. V. Aho, J. E. Hopcroft, and J. D. Ullman, The design and analysis of computer algorithms, 1974.

D. G. Cantor, Computing in the Jacobian of a hyperelliptic curve, Mathematics of Computation, vol.48, issue.177, pp.95-101, 1987.
DOI : 10.1090/S0025-5718-1987-0866101-0

F. Chung and L. Lu, The Diameter of Sparse Random Graphs, Advances in Applied Mathematics, vol.26, issue.4, pp.257-279, 2001.
DOI : 10.1006/aama.2001.0720

D. Coppersmith, Solving Homogeneous Linear Equations Over GF(2) via Block Wiedemann Algorithm, Mathematics of Computation, vol.62, issue.205, pp.333-350, 1994.
DOI : 10.2307/2153413

J. Couveignes, Algebraic groups and discrete logarithm, Public-key cryptography and computational number theory, pp.17-27, 2001.
DOI : 10.1515/9783110881035.17

C. Diem, Index calculus in class groups of plane curves of small degree. Cryptology ePrint Archive, Report, vol.119, 2005.

A. Enge, Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time, Mathematics of Computation, vol.71, issue.238, pp.729-742, 2002.
DOI : 10.1090/S0025-5718-01-01363-1

A. Enge and P. Gaudry, A general framework for subexponential discrete logarithm algorithms, Acta Arithmetica, vol.102, issue.1, pp.83-103, 2002.
DOI : 10.4064/aa102-1-6
URL : https://hal.archives-ouvertes.fr/inria-00512717

P. Flajolet, D. Knuth, and B. Pittel, The first cycles in an evolving graph, Discrete Mathematics, vol.75, issue.1-3, pp.167-215, 1989.
DOI : 10.1016/0012-365X(89)90087-3
URL : https://hal.archives-ouvertes.fr/inria-00075666

P. Gaudry, An Algorithm for Solving the Discrete Log Problem on Hyperelliptic Curves, Advances in Cryptology ? EUROCRYPT 2000, pp.19-34, 2000.
DOI : 10.1007/3-540-45539-6_2
URL : https://hal.archives-ouvertes.fr/inria-00512401

P. Gaudry, Index calculus for abelian varieties and the elliptic curve discrete logarithm problem. Cryptology ePrint Archive, Report, p.73, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00337631

F. Heß, Computing Riemann???Roch Spaces in Algebraic Function Fields and Related Topics, Journal of Symbolic Computation, vol.33, issue.4, pp.425-445, 2002.
DOI : 10.1006/jsco.2001.0513

F. Heß, Computing relations in divisor class groups of algebraic curves over finite fields, 2004.

M. Huang and D. Ierardi, Counting Points on Curves over Finite Fields, Journal of Symbolic Computation, vol.25, issue.1, pp.1-21, 1998.
DOI : 10.1006/jsco.1997.0164

N. Koblitz, Hyperelliptic cryptosystems, Journal of Cryptology, vol.2, issue.4, pp.139-150, 1989.
DOI : 10.1007/BF02252872

A. K. Lenstra and M. S. Manasse, Factoring with two large primes, Mathematics of Computation, vol.63, issue.208, pp.785-798, 1994.
DOI : 10.1090/S0025-5718-1994-1250773-9

P. Leyland, A. K. Lenstra, B. Dodson, A. Muffett, S. S. Wagstaff et al., MPQS with Three Large Primes, Lecture Notes in Comput. Sci, vol.2369, pp.448-462, 2002.
DOI : 10.1007/3-540-45455-1_35

A. Menezes, Y. Wu, and R. Zuccherato, An elementary introduction to hyperelliptic curves. Appendix to Algebraic aspects of cryptography, pp.155-178, 1998.

V. Müller, A. Stein, and C. Thiel, Computing discrete logarithms in real quadratic congruence function fields of large genus, Mathematics of Computation, vol.68, issue.226, pp.807-822, 1999.
DOI : 10.1090/S0025-5718-99-01040-6

J. Pila, Frobenius maps of abelian varieties and finding roots of unity in finite fields, Mathematics of Computation, vol.55, issue.192, pp.745-763, 1990.
DOI : 10.1090/S0025-5718-1990-1035941-X

S. Pohlig and M. Hellman, An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.), IEEE Transactions on Information Theory, vol.24, issue.1, pp.106-110, 1978.
DOI : 10.1109/TIT.1978.1055817

N. Thériault, Index Calculus Attack for Hyperelliptic Curves of Small Genus, Advances in Cryptology ? ASIACRYPT 2003, pp.75-92, 2003.
DOI : 10.1007/978-3-540-40061-5_5

E. Thomé, Subquadratic Computation of Vector Generating Polynomials and Improvement of the Block Wiedemann Algorithm, Journal of Symbolic Computation, vol.33, issue.5, pp.757-775, 2002.
DOI : 10.1006/jsco.2002.0533

E. Thomé, Algorithmes de calcul de logarithme discret dans les corps finis, Thèse, ´ Ecole polytechnique, 2003.

E. Volcheck, Computing in the jacobian of a plane algebraic curve
DOI : 10.1007/3-540-58691-1_60

. Huang, ANTS-I, Lecture Notes in Comput. Sci, vol.877, pp.221-233, 1994.

T. Wollinger, J. Pelzl, and C. Paar, Cantor versus Harley: optimization and analysis of explicit formulae for hyperelliptic curve cryptosystems, IEEE Transactions on Computers, vol.54, issue.7, 2004.
DOI : 10.1109/TC.2005.109