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, pp.28-40, 1994.
DOI : 10.1007/3-540-58691-1_39

R. L. Bender and C. Pomerance, Rigorous discrete logarithm computations in finite fields via smooth polynomials, Computational Perspectives on Number Theory: Proceedings of a Conference in Honor of A.O.L. Atkin, pp.221-232, 1998.
DOI : 10.1090/amsip/007/11

J. Couveignes, Algebraic groups and discrete logarithm, Public-key cryptography and computational number theory, pp.17-27, 2001.
DOI : 10.1515/9783110881035.17
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.5372

C. Diem, An Index Calculus Algorithm for Plane Curves of Small Degree, ANTS-VII, pp.543-557, 2006.
DOI : 10.1007/11792086_38

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
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.109.6188

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

A. Enge and A. Stein, Smooth ideals in hyperelliptic function fields, Mathematics of Computation, vol.71, issue.239, pp.1219-1230, 2002.
DOI : 10.1090/S0025-5718-01-01352-7
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.192.5606

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

P. Gaudry, E. Thomé, N. Thériault, and C. Diem, A double large prime variation for small genus hyperelliptic index calculus, Mathematics of Computation, vol.76, issue.257, pp.475-492, 2007.
DOI : 10.1090/S0025-5718-06-01900-4
URL : https://hal.archives-ouvertes.fr/inria-00077334

G. Haché, Construction effective de codes géométriques, 1996.

J. L. Haffner and K. S. Mccurley, A rigorous subexponential algorithm for computation of class groups, Journal of the American Mathematical Society, vol.2, issue.4, pp.837-850, 1989.
DOI : 10.1090/S0894-0347-1989-1002631-0

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.

E. Manstavi?ius, Remarks on the semigroup elements free of large prime factors, New Trends in Probability and Statistic, pp.135-153, 1992.
DOI : 10.1007/BF00970673

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

A. Storjohann, Algorithms for Matrix Canonical Forms, 2000.