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, M. van Hoeij, J. Klüners, A. Steel.
  
  Factoring polynomials over global fields, in: Journal de Théorie des Nombres de Bordeaux, 2009, vol. 21, n^o 1, p. 15–39.
  
  http://jtnb.cedram.org/item?id=JTNB_2009__21_1_15_0
• 4K. 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
• 5J. 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
• 6J.-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/
• 7H. 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.
• 8H. 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.
• 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.
  
  An $L(1/3+\epsilon$) algorithm for the discrete logarithm problem for low degree curves, in: Advances in Cryptology — Eurocrypt 2007, Berlin, M. Naor (editor), Lecture Notes in Computer Science, Springer-Verlag, 2007, vol. 4515, p. 367–382.
  
  http://hal.inria.fr/inria-00135324/

Articles in International Peer-Reviewed Journal

• 11J.-P. Cerri.
  
  Some Generalized Euclidean and 2-stage Euclidean number fields that are not norm-Euclidean, in: Mathematics of Computation, 2011, vol. 80, n^o 276, p. 2289–2298.
  
  http://hal.archives-ouvertes.fr/hal-00505142/
• 12H. Cohen, A. Morra.
  
  Counting Cubic Extensions with given Quadratic Resolvent, in: Journal of Algebra, 2011, vol. 325, n^o 1, p. 461–478.
  
  http://hal.archives-ouvertes.fr/hal-00463533/
• 13A. 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.
  
  http://hal.inria.fr/inria-00383941/
• 14J.-C. Faugère, D. Lubicz, D. Robert.
  
  Computing modular correspondences for abelian varieties, in: Journal of Algebra, 2011, vol. 343, n^o 1, p. 248–277.
  
  http://hal.inria.fr/hal-00426338/

International Conferences with Proceedings

• 15C. Clavier, B. Feix, G. Ganerot, M. Roussellet, V. Verneuil.
  
  Improved Collision-Correlation Power Analysis on First Order Protected AES, in: Cryptographic Hardware and Embedded Systems — CHES 2011, Berlin, B. Preneel, T. Takagi (editors), Lecture Notes in Computer Science, Springer-Verlag, 2011, vol. 6917, p. 49–62.
  
  http://hal.inria.fr/inria-00633527/

Scientific Books (or Scientific Book chapters)

• 16J.-M. Couveignes, B. Edixhoven.
  
  Computational aspects of modular forms and Galois representations, Princeton University Press, 2011.
  
  http://arxiv.org/abs/math/0605244/

Internal Reports

• 17K. Belabas.
  
  Théorie algébrique des nombres et calcul formel, Cours du CIRM series, 2011, Notes for a series of invited lectures at “Journées Nationales de Calcul Formel 2011”. To appear.
  
  http://www.cedram.org/article.php3?id_article=212
• 18J.-F. Biasse.
  
  An L(1/3) algorithm for ideal class group and regulator computation in certain number fields, HAL-INRIA, 2011, n^o 440223.
  
  http://hal.inria.fr/inria-00440223/
• 19C. Clavier, B. Feix, G. Ganerot, M. Roussellet, V. Verneuil.
  
  Square Always Exponentiation, HAL-INRIA, 2011, n^o 633545, To appear in Proceedings of Indocrypt 2011.
  
  http://hal.inria.fr/inria-00633545/
• 20R. Cosset, D. Robert.
  
  Computing (l,l)-isogenies in polynomial time on Jacobians of genus 2 curves, HAL-INRIA, 2011, n^o 578991.
  
  http://hal.inria.fr/hal-00578991/
• 21J.-M. Couveignes, E. Hallouin.
  
  Global descent obstructions for varieties, HAL, 2011, n^o 630393, To appear in Algebra and Number Theory.
  
  http://hal.archives-ouvertes.fr/hal-00630393/
• 22J.-M. Couveignes, J.-G. Kammerer.
  
  The Geometry of Flex Tangents to a Cubic Curve and its Parameterizations, HAL, 2011, n^o 630392.
  
  http://hal.archives-ouvertes.fr/hal-00630392/
• 23J.-M. Couveignes, R. Lercier.
  
  Fast construction of irreducible polynomials over finite fields, HAL, 2011, n^o 456456, To appear in Israel Journal of Mathematics.
  
  http://hal.archives-ouvertes.fr/hal-00456456/
• 24A. Enge, F. Morain.
  
  Generalised Weber Functions. I, HAL-INRIA, 2011, n^o 385608.
  
  http://hal.inria.fr/inria-00385608/
• 25P. Lezowski.
  
  Computation of the Euclidean minimum of algebraic number fields, HAL, 2011, n^o 632997.
  
  http://hal.archives-ouvertes.fr/hal-00632997/
• 26P. Lezowski.
  
  Examples of norm-Euclidean ideal classes, HAL, 2011, n^o 634643.
  
  http://hal.archives-ouvertes.fr/hal-00634643/
• 27J. Milan.
  
  Factoring Small to Medium Size Integers: An Experimental Comparison, HAL-INRIA, 2011, n^o 188645.
  
  http://hal.inria.fr/inria-00188645/
• 28P. Molin.
  
  Intégration numérique par la méthode double-exponentielle, HAL, 2011, n^o 491561.
  
  http://hal.archives-ouvertes.fr/hal-00491561/
• 29P. Rozenhart, M. Jacobson, R. Scheidler.
  
  Computing quadratic function fields with high 3-rank via cubic field tabulation, HAL-INRIA, 2011, n^o 462008.
  
  http://hal.inria.fr/inria-00462008/
• 30P. Rozenhart, M. Jacobson, R. Scheidler.
  
  Tabulation of Cubic Function Fields Via Polynomial Binary Cubic Forms, HAL-INRIA, 2011, n^o 477111, To appear in Mathematics of Computation.
  
  http://hal.inria.fr/inria-00477111/

• 31K. 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.
• 32J.-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/
• 33J.-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.
• 34D. 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.
• 35H. 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.
• 36A. Enge.
  
  Courbes algébriques et cryptologie, Université Denis Diderot, Paris 7, 2007, Habilitation à diriger des recherches.
  
  http://tel.archives-ouvertes.fr/tel-00382535/en/
• 37A. Rostovtsev, A. Stolbunov.
  
  Public-key cryptosystem based on isogenies, 2006, Preprint, Cryptology ePrint Archive 2006/145.
  
  http://eprint.iacr.org/2006/145/