E. Bach, Explicit bounds for primality testing and related problems, Mathematics of Computation, vol.55, issue.191, pp.355-380, 1990.
DOI : 10.1090/S0025-5718-1990-1023756-8

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

C. Bruce, H. Berndt, and . Chan, Ramanujan and the modular j-invariant, Canadian Mathematical Bulletin, vol.42, issue.4, pp.427-440, 1999.

J. Daniel and . Bernstein, Modular exponentiation via the explicit Chinese Remainder Theorem, Mathematics of Computation, vol.76, pp.443-454, 2007.

G. Bisson and A. V. Sutherland, Computing the endomorphism ring of an ordinary elliptic curve over a finite field, Journal of Number Theory, vol.131, issue.5, 2009.
DOI : 10.1016/j.jnt.2009.11.003
URL : https://hal.archives-ouvertes.fr/inria-00383155

R. Bröker, Constructing elliptic curves of prescribed order, 2006.

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, K. Lauter, and A. V. Sutherland, Modular polynomials via isogeny volcanoes, Mathematics of Computation, vol.81, issue.278, 2009.
DOI : 10.1090/S0025-5718-2011-02508-1

J. Couveignes and T. Henocq, Action of Modular Correspondences around CM Points, Lect. Notes Comput. Sci, vol.2369, pp.234-243, 2002.
DOI : 10.1007/3-540-45455-1_19

N. D. Elkies, Elliptic and modular curves over finite fields and related computational issues, Computational Perspectives on Number Theory, pp.21-76, 1998.

A. Enge, Courbes algébriques et cryptologie 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

A. Enge, Computing modular polynomials in quasi-linear time, Mathematics of Computation, vol.78, issue.267, pp.1809-1824, 2009.
DOI : 10.1090/S0025-5718-09-02199-1
URL : https://hal.archives-ouvertes.fr/inria-00143084

A. Enge and R. Schertz, Constructing elliptic curves over finite fields using double eta-quotients, Journal de Th??orie des Nombres de Bordeaux, vol.16, issue.3, pp.555-568, 2004.
DOI : 10.5802/jtnb.460

A. Enge and R. Schertz, Modular curves of composite level, Acta Arithmetica, vol.118, issue.2, pp.129-141, 2005.
DOI : 10.4064/aa118-2-3
URL : https://hal.archives-ouvertes.fr/inria-00386309

A. Enge and R. Schertz, Abstract, preparation, 2010.
DOI : 10.1112/S146115701300020X

A. Gee, Class fields by Shimura reciprocity, 2001.

A. Gee and P. Stevenhagen, Generating class fields using Shimura reciprocity, ANTS-III, pp.441-453, 1998.
DOI : 10.1007/BFb0054883

F. Hajir and F. Villegas, Explicit elliptic units, I, Duke Mathematical Journal, vol.90, issue.3, pp.495-521, 1997.
DOI : 10.1215/S0012-7094-97-09013-X

D. Harvey, zn poly: a library for polynomial arithmetic, 0.9 edition, 2008.

D. Kohel, Endomorphism rings of elliptic curves over finite fields, 1996.

F. Morain, Calcul du nombre de points sur une courbe elliptique dans un corps fini : aspects algorithmiques, Journal de Th??orie des Nombres de Bordeaux, vol.7, issue.1, pp.111-138, 1995.
DOI : 10.5802/jtnb.143

F. Morain, Advances in the CM method for elliptic curves Slides of Fields Cryptography Retrospective Meeting, 2009.

R. Schertz, Weber's class invariants revisited, Journal de Th??orie des Nombres de Bordeaux, vol.14, issue.1, pp.325-343, 2002.
DOI : 10.5802/jtnb.361

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

V. Andrew and . Sutherland, Computing Hilbert class polynomials with the Chinese Remainder Theorem, Mathematics of Computation, 2010.

H. Weber, I. Lehrbuch-der-algebra, and . Chelsea, INRIA Bordeaux?Sud-Ouest E-mail address: andreas.enge@math.u-bordeaux.fr Massachusetts Institute of Technology E-mail address: drew@math.mit, 1961.