Bibliography

• 1E. Bayer-Fluckiger, J.-P. Cerri, J. Chaubert.
  
  Euclidean minima and central division algebras, in: International Journal of Number Theory, 2009, vol. 5, n^o 7, p. 1155–1168.
  
  http://www.worldscinet.com/ijnt/05/0507/S1793042109002614.html
• 2K. Belabas, M. Bhargava, C. Pomerance.
  
  Error estimates for the Davenport-Heilbronn theorems, in: Duke Mathematical Journal, 2010, vol. 153, n^o 1, p. 173–210.
  
  http://projecteuclid.org/euclid.dmj/1272480934
• 3K. Belabas, F. Diaz y Diaz, E. Friedman.
  
  Small generators of the ideal class group, in: Mathematics of Computation, 2008, vol. 77, n^o 262, p. 1185–1197.
  
  http://www.ams.org/journals/mcom/2008-77-262/S0025-5718-07-02003-0/home.html
• 4J. Belding, R. Bröker, A. Enge, K. Lauter.
  
  Computing Hilbert class polynomials, in: Algorithmic Number Theory — ANTS-VIII, Berlin, A. van der Poorten, A. Stein (editors), Lecture Notes in Computer Science, Springer-Verlag, 2007, vol. 5011.
  
  http://hal.inria.fr/inria-00246115
• 5J.-P. Cerri.
  
  Euclidean minima of totally real number fields: algorithmic determination, in: Math. Comp., 2007, vol. 76, n^o 259, p. 1547–1575.
  
  http://www.ams.org/journals/mcom/2007-76-259/S0025-5718-07-01932-1/
• 6H. Cohen.
  
  Number Theory I: Tools and Diophantine Equations; II: Analytic and Modern Tool, Graduate Texts in Mathematics, Springer-Verlag, New York, 2007, vol. 239/240.
• 7H. Cohen, G. Frey, R. Avanzi, C. Doche, T. Lange, K. Nguyen, F. Vercauteren.
  
  Handbook of Elliptic and Hyperelliptic Curve Cryptography, Discrete mathematics and its applications, Chapman & Hall, Boca Raton, 2006.
• 8J.-M. Couveignes, B. Edixhoven.
  
  Computational aspects of modular forms and Galois representations, Princeton University Press, 2011.
• 9A. Enge.
  
  The complexity of class polynomial computation via floating point approximations, in: Mathematics of Computation, 2009, vol. 78, n^o 266, p. 1089–1107.
  
  http://www.ams.org/mcom/2009-78-266/S0025-5718-08-02200-X/home.html
• 10A. Enge, P. Gaudry, E. Thomé.
  
  An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves, in: Journal of Cryptology, 2011, vol. 24, n^o 1, p. 24–41.

Doctoral Dissertations and Habilitation Theses

• 11P. Lezowski.
  
  Questions d'Euclidianité, University of Bordeaux, 2012.
  
  http://tel.archives-ouvertes.fr/tel-00765252/
• 12V. Verneuil.
  
  Cryptographie à base de courbes elliptiques et sécurité de composants embarqués, University of Bordeaux, 2012.
  
  http://tel.archives-ouvertes.fr/tel-00733004/

Articles in International Peer-Reviewed Journals

• 13J.-M. Couveignes, T. Ezome, R. Lercier.
  
  A faster pseudo-primality test, in: Rendiconti del circolo matematico di Palermo, 2012, vol. 61, n^o 2, p. 261–278.
• 14J.-M. Couveignes, J.-G. Kammerer.
  
  The geometry of flex tangents to a cubic curve and its parameterizations, in: Journal of Symbolic Computation, 2012, vol. 47, n^o 3, p. 266–281.
• 15P. Lezowski.
  
  Examples of norm-Euclidean ideal classes, in: International Journal of Number Theory, 2012, vol. 8, n^o 5, p. 1315–1333.
• 16D. Lubicz, D. Robert.
  
  Computing isogenies between abelian varieties, in: Compositio Mathematica, 2012, vol. 148, n^o 5, p. 1483–1515.
• 17P. Rozenhart, M. Jacobson, R. Scheidler.
  
  Tabulation of Cubic Function Fields Via Polynomial Binary Cubic Forms, in: Mathematics of Computation, 2012, vol. 81, n^o 280, p. 2335–2359.

Scientific Books (or Scientific Book chapters)

• 18D. Bertrand, P. Boalch, J.-M. Couveignes, P. Dèbes.
  
  Geometric and differential Galois theories, Séminaires et Congrès, Société Mathématique de France, 2012, vol. 27.
  
  http://smf4.emath.fr/en/Publications/SeminairesCongres/2012/27/html/smf_sem-cong_27.php
• 19J.-M. Couveignes, B. Edixhoven.
  
  Approximate computations with modular curves, in: Geometry and Arithmetic, C. Faber, G. Farkas, R. de Jong (editors), EMS Series of Congress Reports, European Mathematical Society, Zürich, 2012, vol. 7, p. 91–112.
• 20A. Enge.
  
  Elliptic curve cryptographic systems, in: Handbook of Finite Fields, Boca Raton, G. L. Mullen, D. Panario (editors), Discrete Mathematics and Its Applications, Chapman and Hall/CRC, Boca Raton, 2012.

Internal Reports

• 21A. Angelakis, P. Stevenhagen.
  
  Imaginary quadratic fields with isomorphic abelian Galois groups, ArXiv, 2012, n^o 1209.6005, To appear in Proceedings of Algorithmic Number Theory Symposium — ANTS X.
• 22J.-F. Biasse.
  
  An L(1/3) algorithm for ideal class group and regulator computation in certain number fields, HAL-Inria, 2012, n^o 440223, To appear in Mathematics of Computation.
• 23J.-P. Cerri, J. Chaubert, P. Lezowski.
  
  Euclidean totally definite quaternion fields over the rational field and over quadratic number fields, HAL, 2012, n^o 738164, To appear in International Journal of Number Theory.
• 24H. Cohen.
  
  Haberland's formula and numerical computation of Petersson scalar products, HAL, 2012, To appear in Proceedings of Algorithmic Number Theory Symposium — ANTS X.
  
  http://math.ucsd.edu/%7Ekedlaya/ants10/cohen/paper.pdf
• 25R. Cosset, D. Robert.
  
  Computing (l,l)-isogenies in polynomial time on Jacobians of genus 2 curves, HAL-Inria, 2012, n^o 578991.
• 26J.-M. Couveignes, R. Lercier.
  
  Fast construction of irreducible polynomials over finite fields, HAL, 2012, n^o 456456, To appear in Israel Journal of Mathematics.
• 27A. Enge.
  
  Bilinear pairings on elliptic curves, HAL-Inria, 2012, n^o 767404.
• 28A. Enge, F. Morain.
  
  Generalised Weber Functions. I, HAL-Inria, 2012, n^o 385608.
• 29A. Enge, R. Schertz.
  
  Singular values of multiple eta-quotients for ramified primes, HAL-Inria, 2012, n^o 768375.
• 30K. Lauter, D. Robert.
  
  Improved CRT Algorithm for Class Polynomials in Genus 2, HAL, 2012, n^o 734450, To appear in Proceedings of Algorithmic Number Theory Symposium — ANTS X.
• 31P. Lezowski.
  
  Computation of the Euclidean minimum of algebraic number fields, HAL, 2012, n^o 632997, To appear in Mathematics of Computation.
• 32N. Mascot.
  
  Computing modular Galois representations, ArXiv, 2012, n^o 1211.1635.
• 33P. Molin.
  
  Intégration numérique par la méthode double-exponentielle, HAL, 2012, n^o 491561.
• 34A. Page.
  
  Computing arithmetic Kleinian groups, HAL, 2012, n^o 703043.
• 35P. Rozenhart, M. Jacobson, R. Scheidler.
  
  Computing quadratic function fields with high 3-rank via cubic field tabulation, HAL-Inria, 2012, n^o 462008.

• 36K. Belabas.
  
  L'algorithmique de la théorie algébrique des nombres, in: Théorie algorithmique des nombres et équations diophantiennes, N. Berline, A. Plagne, C. Sabbah (editors), 2005, p. 85–155.
• 37J.-P. Cerri.
  
  Spectres euclidiens et inhomogènes des corps de nombres, IECN, Université Henri Poincaré, Nancy, 2005.
  
  http://tel.archives-ouvertes.fr/tel-00011151/en/
• 38J.-P. Cerri.
  
  Inhomogeneous and Euclidean spectra of number fields with unit rank strictly greater than 1, in: J. Reine Angew. Math., 2006, vol. 592, p. 49–62.
• 39D. X. Charles, E. Z. Goren, K. E. Lauter.
  
  Cryptographic Hash Functions from Expander Graphs, in: Journal of Cryptology, 2009, vol. 22, n^o 1, p. 93–113.
• 40H. Cohen, P. Stevenhagen.
  
  Computational class field theory, in: Algorithmic Number Theory — Lattices, Number Fields, Curves and Cryptography, J. Buhler, P. Stevenhagen (editors), MSRI Publications, Cambridge University Press, 2008, vol. 44.
• 41A. Enge.
  
  Courbes algébriques et cryptologie, Université Denis Diderot, Paris 7, 2007, Habilitation à diriger des recherches.
  
  http://tel.archives-ouvertes.fr/tel-00382535/en/
• 42A. Enge.
  
  Elliptic Curves and Their Applications to Cryptography — An Introduction, Kluwer Academic Publishers, 1999.
• 43A. Rostovtsev, A. Stolbunov.
  
  Public-key cryptosystem based on isogenies, 2006, Preprint, Cryptology ePrint Archive 2006/145.
  
  http://eprint.iacr.org/2006/145/
• 44J. Voight.
  
  Computing fundamental domains for Fuchsian groups, in: J. Théor. Nombres Bordeaux, 2009, vol. 21, n^o 2, p. 469–491.
  
  http://www.cems.uvm.edu/~jvoight/articles/funddom-jntb-galley.pdf