L. Adleman and M. Huang, Counting Points on Curves and Abelian Varieties Over Finite Fields, Journal of Symbolic Computation, vol.32, issue.3, pp.171-189, 2001.
DOI : 10.1006/jsco.2001.0470
URL : http://doi.org/10.1006/jsco.2001.0470

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

M. Bauer, E. Teske, and A. Weng, Point counting on Picard curves in large characteristic, Mathematics of Computation, vol.74, issue.252, pp.1983-2005, 2005.
DOI : 10.1090/S0025-5718-05-01758-8

W. Bosma and J. Cannon, Handbook of Magma functions, 1997.

J. Bost and J. Mestre, Moyenne arithmético-géométrique et périodes de courbes de genre 1 et 2, pp.36-64, 1988.

A. Bostan, P. Gaudry, and . Schost, Linear Recurrences with Polynomial Coefficients and Computation of the Cartier-Manin Operator on Hyperelliptic Curves, Finite Fields and Applications, 7th International Conference, Fq7, pp.40-58, 2004.
DOI : 10.1007/978-3-540-24633-6_4
URL : https://hal.archives-ouvertes.fr/inria-00514132

A. Bostan, P. Gaudry, and . Schost, Linear Recurrences with Polynomial Coefficients and Application to Integer Factorization and Cartier???Manin Operator, SIAM Journal on Computing, vol.36, issue.6, pp.1777-1806, 2007.
DOI : 10.1137/S0097539704443793
URL : https://hal.archives-ouvertes.fr/inria-00103401

D. G. Cantor, On the analogue of the division polynomials for hyperelliptic curves, J. Reine Angew. Math, vol.447, pp.91-145, 1994.

R. Carls and D. Lubicz, A p-Adic Quasi-Quadratic Time Point Counting Algorithm, International Mathematics Research Notices, pp.698-735, 2009.
DOI : 10.1093/imrn/rnn143
URL : https://hal.archives-ouvertes.fr/hal-00383103

W. Castryck, J. Denef, and F. Vercauteren, Computing zeta functions of nondegenerate curves, International Mathematics Research Papers, 2006.
DOI : 10.1155/IMRP/2006/72017

W. Castryck, H. Hubrechts, and F. Vercauteren, Computing Zeta Functions in Families of C a,b Curves Using Deformation, ANTS-VIII, pp.296-311, 2008.
DOI : 10.1007/978-3-540-79456-1_20

A. Chambert-loir, Compter (rapidement) le nombre de solutions d'´ equations dans les corps finis, Séminaire Bourbaki, p.968, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00133408

L. S. Charlap, R. Coley, and D. P. Robbins, Enumeration of rational points on elliptic curves over finite fields. Draft, 1991.

J. Couveignes, Computing l-isogenies using the p-torsion, Second International Symposium, ANTS-II, pp.59-65, 1996.
DOI : 10.1007/3-540-61581-4_41

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

J. Denef and F. Vercauteren, Counting points on C ab curves using Monsky-Washnitzer cohomology. Finite Fields and Their Applications, pp.78-102, 2006.

J. Denef and F. Vercauteren, An Extension of Kedlaya's Algorithm to Hyperelliptic Curves in Characteristic 2, Journal of Cryptology, vol.19, issue.1, pp.1-25, 2006.
DOI : 10.1007/s00145-004-0231-y

R. Dupont, Moyenne arithmético-géométrique, suites de Borchardt et applications, 2006.

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

A. Enge and F. Morain, SEA in genus 1: 2500 decimal digits, 2006.

M. Fouquet, P. Gaudry, and R. Harley, An extension of Satoh's algorithm and its implementation, J. Ramanujan Math. Soc, vol.15, pp.281-318, 2000.

P. Gaudry, NTLJac2, Tools for genus 2 Jacobians in NTL

P. Gaudry, A Comparison and a Combination of SST and AGM Algorithms for Counting Points of Elliptic Curves in Characteristic 2, Advances in Cryptology ? ASIACRYPT 2002, pp.311-327, 2002.
DOI : 10.1007/3-540-36178-2_20
URL : https://hal.archives-ouvertes.fr/inria-00514137

P. Gaudry and N. Gürel, Counting Points in Medium Characteristic Using Kedlaya's Algorithm, Experimental Mathematics, vol.23, issue.1, pp.395-402, 2003.
DOI : 10.1080/10586458.2003.10504508

P. Gaudry and . Schost, Construction of Secure Random Curves of Genus 2 over Prime Fields, Advances in Cryptology ? EUROCRYPT 2004, pp.239-256, 2004.
DOI : 10.1007/978-3-540-24676-3_15
URL : https://hal.archives-ouvertes.fr/inria-00514121

P. Gaudry and . Schost, Modular equations for hyperelliptic curves, Mathematics of Computation, vol.74, issue.249, pp.429-454, 2005.
DOI : 10.1090/S0025-5718-04-01682-5
URL : https://hal.archives-ouvertes.fr/inria-00000627

R. Harley, Asymptotically optimal p-adic point-counting. e-mail to the NMBRTHRY list, 2002.

R. Harley, Cardinality of a genus 2 hyperelliptic curve over GF (2 4001 ). e-mail to the NMBRTHRY list, 2002.

D. Harvey, Kedlaya's Algorithm in Larger Characteristic, International Mathematics Research Notices, 2007.
DOI : 10.1093/imrn/rnm095
URL : http://arxiv.org/abs/math/0610973

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

H. Hubrechts, Abstract, LMS Journal of Computation and Mathematics, vol.7, pp.207-234, 2007.
DOI : 10.1007/s00145-004-0231-y

H. Hubrechts, Point Counting in Families of Hyperelliptic Curves, Foundations of Computational Mathematics, vol.7, issue.1, pp.137-169, 2008.
DOI : 10.1007/s10208-007-9000-2

H. Hubrechts, Quasi-quadratic elliptic curve point counting using rigid cohomology, Journal of Symbolic Computation, vol.44, issue.9, pp.1255-1267, 2009.
DOI : 10.1016/j.jsc.2008.02.015
URL : http://doi.org/10.1016/j.jsc.2008.02.015

S. Kiran and . Kedlaya, Counting points on hyperelliptic curves using Monsky-Washnitzer cohomology, J. Ramanujan Math. Soc, vol.16, issue.4, pp.323-338, 2001.

H. Kim, J. Park, J. Cheon, J. Park, J. Kim et al., Fast Elliptic Curve Point Counting Using Gaussian Normal Basis, Lecture Notes in Comput. Sci, vol.2369, pp.292-307, 2002.
DOI : 10.1007/3-540-45455-1_24
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.3.8915

A. Lauder, Computing Zeta Functions of Kummer Curves via Multiplicative Characters, Foundations of Computational Mathematics, vol.3, issue.3, pp.273-295, 2003.
DOI : 10.1007/s10208-002-0066-6

A. Lauder, Deformation theory and the computation of zeta functions, Proc. London Math. Soc, pp.565-602, 2004.
DOI : 10.1112/S0024611503014461

A. Lauder and D. Wan, Counting points on varieties over finite fields of small characteristic, 2001.

A. Lauder and D. Wan, Abstract, LMS Journal of Computation and Mathematics, vol.1122, pp.34-55, 2002.
DOI : 10.2307/2374675

A. Lauder and D. Wan, Computing zeta functions of Artin-Schreier curves over finite fields II, Journal of Complexity, vol.20, issue.2-3, pp.331-349, 2004.
DOI : 10.1016/j.jco.2003.08.009

R. Lercier, Computing isogenies in $$\mathbb{F}_{2^n } $$, Lecture Notes in Comput. Sci, vol.1122, pp.197-212, 1996.
DOI : 10.1007/3-540-61581-4_55

R. Lercier and D. Lubicz, A quasi quadratic time algorithm for hyperelliptic curve point counting, The Ramanujan Journal, vol.2, issue.1, pp.399-423, 2006.
DOI : 10.1007/s11139-006-0151-6
URL : https://hal.archives-ouvertes.fr/hal-00456401

R. Lercier and F. Morain, Computing isogenies between elliptic curves over $F_{p^n}$ using Couveignes's algorithm, Mathematics of Computation, vol.69, issue.229, pp.351-370, 2000.
DOI : 10.1090/S0025-5718-99-01081-9
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.36.4076

J. Lubin, J. P. Serre, and J. Tate, Elliptic curves and formal groups In Lecture notes prepared in connection with the seminars held at the Summer Institute on Algebraic Geometry, 1964.

M. Madsen, A p-adic point counting algorithm for elliptic curves on Legendre form. Finite Fields and Their Applications, pp.71-88, 2005.

J. Mestre, Algorithmes pour compter des points de courbes en petite caractéristique et en petit genre. Exposé donnédonnéà Rennes en mars, 2002.

J. Mestre, Utilisation de l'AGM pour le calcul de E(F2n ) Lettre adresséè a Gaudry et Harley, 2000.

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

F. Oort, Lifting algebraic curves, abelian varieties, and their endomorphisms to characteristic zero, Algebraic geometry, pp.165-195, 1985.
DOI : 10.1090/pspum/046.2/927980

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

F. Richelot, Essai sur une méthode générale pour déterminer les valeurs des intégrales ultra-elliptiques, fondée sur des transformations remarquables de ces transcendantes, C. R. Acad. Sci. Paris, vol.2, pp.622-627, 1836.

C. Ritzenthaler, Point Counting on Genus 3 Non Hyperelliptic Curves, Lecture Notes in Comput. Sci, vol.3076, pp.379-394, 2004.
DOI : 10.1007/978-3-540-24847-7_29
URL : https://hal.archives-ouvertes.fr/hal-01099875

T. Satoh, The canonical lift of an ordinary elliptic curve over a finite field and its point counting, J. Ramanujan Math. Soc, vol.15, pp.247-270, 2000.

T. Satoh, B. Skjernaa, and Y. Taguchi, Fast computation of canonical lifts of elliptic curves and its application to point counting. Finite Fields and Their Applications, pp.89-101, 2003.

R. Schoof, Elliptic curves over finite fields and the computation of square roots mod p, Math. Comp, vol.44, pp.483-494, 1985.

R. Schoof, Counting points on elliptic curves over finite fields, Journal de Th??orie des Nombres de Bordeaux, vol.7, issue.1, pp.219-254, 1995.
DOI : 10.5802/jtnb.142
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.56.4044

V. Shoup, NTL: A library for doing number theory

B. Skjernaa, Satoh's algorithm in characteristic 2, Mathematics of Computation, vol.72, issue.241, pp.477-487, 2003.
DOI : 10.1090/S0025-5718-02-01434-5
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.154.103

H. Stichtenoth, Algebraic function fields and codes, 1993.

F. Vercauteren, Computing zeta functions of curves over finite fields, 2003.

F. Vercauteren, B. Preneel, and J. Vandewalle, A Memory Efficient Version of Satoh???s Algorithm, Advances in Cryptology ? EUROCRYPT 2001, pp.1-13, 2001.
DOI : 10.1007/3-540-44987-6_1

J. Zur-gathen and J. Gerhard, Modern computer algebra, 1999.
DOI : 10.1017/CBO9781139856065

A. Weng, A Low-Memory Algorithm for Point Counting on Picard Curves, Designs, Codes and Cryptography, vol.12, issue.143, pp.383-393, 2006.
DOI : 10.1007/s10623-005-1598-y