M. Leonard, J. Adleman, M. Demarrais, and . Huang, A subexponential algorithm for discrete logarithms over the rational subgroup of the Jacobians of large genus hyperelliptic curves over finite fields, Algorithmic Number Theory ? ANTS-I, pp.28-4011078, 1994.

S. Arita, Algorithms for computations in Jacobian group of C ab curve and their application to discrete-log based public key cryptosystems, Japanese. English translation in the proceedings of the Conference on The Mathematics of Public Key Cryptography, pp.82-1291, 1999.

S. Arita, An addition algorithm in Jacobian of Cab curves, Discrete Applied Mathematics, vol.130, issue.1, pp.13-31, 2003.
DOI : 10.1016/S0166-218X(02)00586-3

A. Basiri, A. Enge, J. Faugère, and N. Gürel, Implementing the Arithmetic of C 3,4 Curves, Algorithmic Number Theory ? ANTS-VI, pp.87-101, 2004.
DOI : 10.1007/978-3-540-24847-7_6
URL : https://hal.archives-ouvertes.fr/hal-01497045

L. Mark and . Bauer, The arithmetic of certain cubic function fields, Mathematics of Computation, vol.73, issue.245, pp.387-413, 2004.

G. David and . Cantor, Computing in the Jacobian of a hyperelliptic curve, Mathematics of Computation, vol.48, issue.88, pp.95-10111118, 1987.

A. Enge, The extended Euclidian algorithm on polynomials, and the computational efficiency of hyperelliptic cryptosystems. Designs, Codes and Cryptography, pp.53-7494096, 2001.

A. Enge, A General Framework for Subexponential Discrete Logarithm Algorithms in Groups of Unknown Order, Finite Geometries, pp.133-146, 2001.
DOI : 10.1007/978-1-4613-0283-4_8

A. Enge, Computing discrete logarithms in high-genus hyperelliptic Jacobians in provably subexponential time, Mathematics of Computation, vol.71, issue.238, pp.729-74268083, 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-10311225, 2002.
DOI : 10.4064/aa102-1-6
URL : https://hal.archives-ouvertes.fr/inria-00512717

J. Faugère, P. Gianni, D. Lazard, and T. Mora, Efficient Computation of Zero-dimensional Gr??bner Bases by Change of Ordering, Journal of Symbolic Computation, vol.16, issue.4, pp.329-34468095, 1993.
DOI : 10.1006/jsco.1993.1051

S. D. Galbraith, S. Paulus, and N. P. Smart, Arithmetic on superelliptic curves, Mathematics of Computation, vol.71, issue.237, pp.393-405, 2002.
DOI : 10.1090/S0025-5718-00-01297-7

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

P. Gaudry and N. Gürel, An Extension of Kedlaya???s Point-Counting Algorithm to Superelliptic Curves, Advances in Cryptology ? ASIACRYPT 2001, pp.480-49411159, 2001.
DOI : 10.1007/3-540-45682-1_28

R. Harasawa and J. Suzuki, Fast Jacobian Group Arithmetic on C ab Curves, Algorithmic Number Theory ? ANTS-IV, volume 1838 of Lecture Notes in Computer Science, pp.359-37611073, 2000.
DOI : 10.1007/10722028_21

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

M. Huang and D. Ierardi, Efficient Algorithms for the Riemann-Roch Problem and for Addition in the Jacobian of a Curve, Journal of Symbolic Computation, vol.18, issue.6, pp.519-53914077, 1994.
DOI : 10.1006/jsco.1994.1063

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

S. Miura, A. Basiri, J. Enge, A. N. Faug-`-erefaug-`-faug-`-ere, and . Urel, Linear codes on affine algebraic curves, Japanese. English summary by Ryutaroh Matsumoto, pp.81-1398, 1998.

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

S. Paulus, Lattice basis reduction in function fields Algorithmic Number Theory ? ANTS-III, volume 1423 of, Lecture Notes in Computer Science, pp.567-57511193, 1998.

R. Scheidler, Ideal arithmetic and infrastructure in purely cubic function fields, Journal de Th??orie des Nombres de Bordeaux, vol.13, issue.2, pp.609-631, 2001.
DOI : 10.5802/jtnb.340

E. Volcheck, Computing in the jacobian of a plane algebraic curve, Algorithmic Number Theory ? ANTS-I, pp.221-23314033, 1994.
DOI : 10.1007/3-540-58691-1_60

A. Weil, Sur les courbes alg??briques et les vari??t??s qui s???en d??duisent (Introduction), Courbes algébriques et variétés abéliennes. Hermann, p.262, 1948.
DOI : 10.1007/978-1-4757-1705-1_46