J. Belding, R. Bröker, A. Enge, and K. Lauter, Computing Hilbert Class Polynomials, Algorithmic Number Theory, 8th International Symposium, ANTS-VIII Proceedings, pp.282-295, 2008.
DOI : 10.1007/978-3-540-79456-1_19
URL : https://hal.archives-ouvertes.fr/inria-00246115

C. Borchardt, Das arithmetisch-geometrische Mittel aus vier Elementen, Monatsberichte der Königlich Preußischen Akademie der Wissenschaften zu Berlin, pp.611-621, 1876.
DOI : 10.1515/crll.1861.58.127
URL : http://www.digizeitschriften.de/download/PPN243919689_0058/PPN243919689_0058___log10.pdf

C. Borchardt, Theorie des arithmetisch-geometrischen Mittels aus vier Elementen, Mathematische Abhandlungen der Königlichen Akademie der Wissenschaften zu Berlin, pp.33-96, 1878.

M. Jonathan, P. B. Borwein, and . Borwein, Pi and the AGM, 1987.

R. Brent and P. Zimmermann, Modern Computer Arithmetic, Cambridge Monographs on Applied and Computational Mathematics, vol.18, 2010.
DOI : 10.1017/CBO9780511921698
URL : https://hal.archives-ouvertes.fr/cel-01500109

R. P. Brent, Fast Multiple-Precision Evaluation of Elementary Functions, Journal of the ACM, vol.23, issue.2, pp.242-251, 1976.
DOI : 10.1145/321941.321944

R. Bröker, A $p$-adic algorithm to compute the Hilbert class polynomial, Mathematics of Computation, vol.77, issue.264, pp.2417-2435, 2008.
DOI : 10.1090/S0025-5718-08-02091-7

R. Bröker, D. Gruenewald, and K. Lauter, Explicit CM theory for level 2-structures on abelian surfaces, Algebra & Number Theory, vol.5, issue.4, pp.495-528, 2011.
DOI : 10.2140/ant.2011.5.495

H. Cohen, A course in algorithmic algebraic number theory, volume 138 of Grad. Texts in Math, 1993.

R. Cosset, Applications des fonctions thêta à la cryptographie sur courbes hyperelliptiques. Thèse, Université Henri Poincaré -Nancy I, 2011.

J. Couveignes and T. Henocq, Action of Modular Correspondences around CM Points, Algorithmic Number Theory ? ANTS-V, volume 2369 of Lecture Notes in Computer Science, pp.234-243, 2002.
DOI : 10.1007/3-540-45455-1_19

R. Dupont, Fast evaluation of modular functions using Newton iterations and the AGM, Mathematics of Computation, vol.80, issue.275, pp.1823-1847, 2011.
DOI : 10.1090/S0025-5718-2011-01880-6
URL : https://hal.archives-ouvertes.fr/hal-00644845

R. Dupont, Moyenne arithmético-géométrique, suites de Bor- chardt et applications, Thèse, École Polytechnique, 2006.

A. Enge, The complexity of class polynomial computation via floating point approximations, Mathematics of Computation, vol.78, issue.266, pp.1089-1107, 2009.
DOI : 10.1090/S0025-5718-08-02200-X
URL : https://hal.archives-ouvertes.fr/inria-00001040

A. Enge, Mpfrcx ? A library for univariate polynomials over arbitrary precision real or complex numbers. INRIA, 2013.

A. Enge, M. Gastineau, P. Théveny, and P. Zimmermann, Gnu Mpc ? A library for multiprecision complex arithmetic with exact rounding. INRIA, 2012.

A. Enge and F. Morain, Fast Decomposition of Polynomials with Known Galois Group, Lecture Notes in Computer Science, vol.2643, pp.254-264, 2003.
DOI : 10.1007/3-540-44828-4_27

A. Enge and E. Thomé, Cmh ? Computation of Igusa Class Polynomials, Development version, 2013.

P. Gaudry, T. Houtmann, D. R. Kohel, C. Ritzenthaler, and A. Weng, The 2-Adic CM Method for Genus 2 Curves with Application to Cryptography, Advances in Cryptology ? ASIACRYPT 2006, pp.114-129, 2006.
DOI : 10.1007/11935230_8
URL : https://hal.archives-ouvertes.fr/inria-00103435

E. Gottschling, Explizite Bestimmung der Randfl???chen des Fundamentalbereiches der Modulgruppe zweiten Grades, Mathematische Annalen, vol.83, issue.2, pp.103-124, 1959.
DOI : 10.1007/BF01342938

T. Granlund, Gmp ? The Gnu Multiple Precision Arithmetic Library, 2013.

G. Hanrot, V. Lefèvre, P. Pélissier, and P. Zimmermann, Gnu Mpfr ? A library for multiple-precision floating-point computations with exact rounding, 2013.

J. Igusa, On Siegel Modular Forms of Genus Two, American Journal of Mathematics, vol.84, issue.1, pp.175-200, 1962.
DOI : 10.2307/2372812

J. Igusa, Theta functions, volume 194 of Die Grundlehren der mathematischen Wissenschaften, 1972.

H. Klingen, Introductory lectures on Siegel modular forms, volume 20 of Cambridge studies in advanced mathematics, 1990.

E. Kristin, D. Lauter, and . Robert, Improved CRT algorithm for class polynomials in genus 2 of The Open Book Series, ANTS X ? Proceedings of the Tenth Algorithmic Number Theory Symposium, pp.437-461, 2013.

J. Mestre, Construction de courbes de genre 2 ?? partir de leurs modules, Effective methods in algebraic geometry, pp.313-334, 1991.
DOI : 10.1007/978-1-4612-0441-1_21

G. Shimura, Abelian Varieties with Complex Multiplication and Modular Functions, 1998.
DOI : 10.1515/9781400883943

G. Shimura and Y. Taniyama, Complex Multiplication of Abelian Varieties and its Applications to Number Theory, 1961.

A. Spallek, Kurven vom Geschlecht 2 und ihre Anwendung in Public- Key-Kryptosystemen, 1994.

M. Streng, Computing Igusa class polynomials, Mathematics of Computation, vol.83, issue.285, p.4766, 2009.
DOI : 10.1090/S0025-5718-2013-02712-3
URL : http://arxiv.org/abs/0903.4766

M. Streng, Complex multiplication of abelian surfaces, 2010.

J. Von, Z. Gathen, and J. Gerhard, Modern Computer Algebra, 1999.