]. A. Literatur1, F. Atkin, and . Morain, Elliptic curves and primality proving, Mathematics of Computation, issue.203, pp.6129-68, 1993.

J. Belding, R. Bröker, A. Enge, and K. Lauter, Computing Hilbert Class Polynomials, Algorithmic Number Theory ? ANTS- VIII, pp.282-295, 2008.
DOI : 10.1007/978-3-540-79456-1_19

URL : https://hal.archives-ouvertes.fr/inria-00246115

R. Bröker and P. Stevenhagen, Elliptic Curves with a Given Number of Points, Algorithmic Number Theory ? ANTS-VI, pp.117-131, 2004.
DOI : 10.1007/978-3-540-24847-7_8

J. Couveignes and T. Henocq, Action of Modular Correspondences around CM Points
DOI : 10.1007/3-540-45455-1_19

M. Deuring, Die Typen der Multiplikatorenringe elliptischer Funktionenkörper Abhandlungen aus dem mathematischen Seminar der hamburgischen Universität, pp.197-272, 1941.
DOI : 10.1007/bf02940746

M. Deuring, Die Klassenkörper der komplexen Multiplikation, 1958.

R. Dupont, Fast evaluation of modular functions using Newton iterations and the AGM, Mathematics of Computation, vol.80, issue.275, 2007.
DOI : 10.1090/S0025-5718-2011-01880-6

URL : https://hal.archives-ouvertes.fr/hal-00644845

A. Enge, Courbes algébriques et cryptologie . HabilitationàHabilitation`Habilitationà diriger des recherches, 2007.

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

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

R. Schertz, Complex Multiplikation, 2010.

V. Andrew and . Sutherland, Computing Hilbert class polynomials with the Chinese remainder theorem, 2009.