L. M. Adleman, C. Pomerance, and R. S. Rumely, On Distinguishing Prime Numbers from Composite Numbers, The Annals of Mathematics, vol.117, issue.1, pp.173-206, 1983.
DOI : 10.2307/2006975

M. Agrawal, N. Kayal, and N. Saxena, PRIMES is in P. Preprint, 2002.

A. O. Atkin and F. Morain, Elliptic curves and primality proving, Mathematics of Computation, vol.61, issue.203, pp.6129-68, 1993.
DOI : 10.1090/S0025-5718-1993-1199989-X
URL : https://hal.archives-ouvertes.fr/inria-00075302

M. Ayad, Points S-entiers des courbes elliptiques, Manuscripta Mathematica, vol.82, issue.1, pp.305-324, 1992.
DOI : 10.1007/BF02567763
URL : http://www.digizeitschriften.de/download/PPN365956996_0076/PPN365956996_0076___log26.pdf

D. Bernstein, Proving primality after Agrawal-Kayal-Saxena, 2003.

D. Bernstein and P. Berrizbeitia, Proving primality in essentially quartic expected time Sharpening " Primes is in P " for a large family of numbers, 2002.

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

Q. Cheng, Primality Proving via One Round in ECPP and One Iteration in AKS, Advances in Cryptology ? CRYPTO 2003, pp.338-348, 2003.
DOI : 10.1007/978-3-540-45146-4_20

H. Cohen, H. W. Lenstra, and J. , Heuristics on class groups of number fields, Number Theory Proc. of the Journées Arithmétiques, pp.33-62, 1983.
DOI : 10.1007/BF01199694

H. Cohen, H. W. Lenstra, and J. , Primality testing and Jacobi sums, Mathematics of Computation, vol.42, issue.165, pp.297-330, 1984.
DOI : 10.1090/S0025-5718-1984-0726006-X

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

D. A. Cox, Primes of the form x 2 + ny 2, 1989.

R. Crandall and C. Pomerance, Prime numbers ? A Computational Perspective, 2000.

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

A. Enge and F. Morain, Comparing Invariants for Class Fields of Imaginary Quadratic Fields, Algorithmic Number Theory, pp.252-266
DOI : 10.1007/3-540-45455-1_21

A. Enge and F. Morain, Fast Decomposition of Polynomials with Known Galois Group, 15th International Symposium, pp.254-264, 2003.
DOI : 10.1007/3-540-44828-4_27

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

A. Enge and P. Zimmermann, mpc ? a library for multiprecision complex arithmetic with exact rounding, 2002.

J. Franke, T. Kleinjung, F. Morain, and T. Wirth, Proving the Primality of Very Large Numbers with fastECPP, Algorithmic Number Theory, pp.194-207
DOI : 10.1007/978-3-540-24847-7_14

W. F. Galway, Analytic computation of the prime-counting function, 2004.

J. Zur-gathen and J. Gerhard, Modern Computer Algebra, 1999.
DOI : 10.1017/CBO9781139856065

A. Gee, Class invariants by Shimura's reciprocity law, Journal de Th??orie des Nombres de Bordeaux, vol.11, issue.1, pp.45-72, 1999.
DOI : 10.5802/jtnb.238

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

S. Goldwasser and J. Kilian, Primality testing using elliptic curves, Journal of the ACM, vol.46, issue.4, pp.450-472, 1999.
DOI : 10.1145/320211.320213

G. Hanrot, V. Lefèvre, and P. Zimmermann, mpfr ? a library for multiple-precision floating-point computations with exact rounding, 2002. Version contained in gmp Available from http

G. Hanrot and F. Morain, Solvability by radicals from an algorithmic point of view, Proceedings of the 2001 international symposium on Symbolic and algebraic computation , ISSAC '01, pp.175-182, 2001.
DOI : 10.1145/384101.384125
URL : https://hal.archives-ouvertes.fr/inria-00100542

A. K. Lenstra, H. W. Lenstra, and J. , Algorithms in Number Theory, Algorithms and Complexity, vol.12, pp.674-715, 1990.
DOI : 10.1016/B978-0-444-88071-0.50017-5

S. Louboutin, Computation of class numbers of quadratic number fields, Mathematics of Computation, vol.71, issue.240, pp.1735-1743, 2002.
DOI : 10.1090/S0025-5718-01-01367-9

P. Mih?-ailescu, Fast convolutions meet Montgomery, 2004.

P. Mih?-ailescu and R. Avanzi, Efficient quasi-deterministic primality test improving AKS Available from http, 2003.

F. Morain, Primality proving using elliptic curves: An update, Third International Symposium, ANTS-III, pp.111-127, 1998.
DOI : 10.1007/BFb0054855

F. M. Agrawal, S. ]. Kayal, and . Astérisque, La primalité en temps polynomial [d'après Adleman, Huang, Séminaire Bourbaki, vol.ix, issue.917, pp.205-230, 2002.

R. Schertz, Weber's class invariants revisited, Morain) LIXÉcoleLIX´LIXÉcole Polytechnique, CNRS/UMR 7161, INRIA/Futurs, F-91128 Palaiseau CEDEX, FRANCE E-mail address, pp.325-343, 2002.
DOI : 10.5802/jtnb.361