2011

Books

• Jean-Marc Couveignes and Bas Edixhoven:
  Computational aspects of modular forms and Galois representations.
  Princeton University Press 2011.

Journals

• Jean-Paul Cerri:
  Some Generalized Euclidean and 2-stage Euclidean number fields that are not norm-Euclidean.
  Mathematics of Computation 80 (276), 2011, pp. 2289–2298.
• Jean-Marc Couveignes and Emmanuel Hallouin:
  Global descent obstructions for varieties.
  Algebra & Number Theory 5 (4), 2011, pp. 431–463.
• Henri Cohen and Anna Morra:
  Counting Cubic Extensions with given Quadratic Resolvent.
  Journal of Algebra 325 (1), 2011, pp. 461–478.
• Andreas Enge, Pierrick Gaudry and Emmanuel Thomé:
  An L(1/3) Discrete Logarithm Algorithm for Low Degree Curves.
  Journal of Cryptology 24 (1), 2011, pp. 24–41.
• Jean-Charles Faugère, David Lubicz and Damien Robert:
  Computing modular correspondences for abelian varieties.
  Journal of Algebra 343 (1), 2011, pp. 248–277.

Conferences

• Karim Belabas:
  Théorie algébrique des nombres et calcul formel.
  In Guillaume Chèze, Thomas Cluzeau, Grégoire Lecerf and Clément Pernet (editors):
  Journées Nationales de Calcul Formel
  Les cours du CIRM vol. 2.
  2011, pp. 40.
• Christophe Clavier, Benoit Feix, Georges Ganerot, Mylène Roussellet and Vincent Verneuil:
  Improved Collision-Correlation Power Analysis on First Order Protected AES.
  In Bart Preneel and Tsuyoshi Takagi (editors):
  Cryptographic Hardware and Embedded Systems — CHES 2011
  Lecture Notes in Computer Science vol. 6917.
  Springer-Verlag, Berlin 2011, pp. 49–62.
• Christophe Clavier, Benoit Feix, Georges Ganerot, Mylène Roussellet and Vincent Verneuil:
  Square Always Exponentiation.
  In Daniel J. Bernstein and Sanjit Chatterjee (editors):
  Progress in Cryptology – INDOCRYPT 2011
  Lecture Notes in Computer Science vol. 7107.
  Springer-Verlag, Berlin 2011, pp. 40–57.