2015

Doctoral dissertations

• Athanasios Angelakis:
  Universal Adelic Groups for Imaginary Quadratic Number Fields and Elliptic Curves.
  University of Bordeaux and University Leiden 2015.
• Enea Milio:
  Calcul de polynômes modulaires en dimension 2.
  University of Bordeaux 2015.

Journals

• Bill Allombert, Yuri Bilu and Amalia Pizarro-Madariaga:
  CM-Points on Straight Lines.
  In Carl Pomerance and Michael Th. Rassias (editors):
  Analytic Number Theory – In Honor of Helmut Maier's 60th Birthday
  Springer International Publishing Switzerland, Cham 2015, pp. 1–18.
• Karim Belabas and Eduardo Friedman:
  Computing the residue of the Dedekind zeta function.
  Mathematics of Computation 84 (291), 2015, pp. 357–369.
• Jean-Marc Couveignes and Tony Ezome:
  Computing functions on Jacobians and their quotients.
  LMS Journal of Computation and Mathematics 18, 2015, pp. 555–577.
• Henri Cohen:
  Exact counting of $D_\ell$ number fields with given quadratic resolvent.
  Mathematics of Computation 84 (294), 2015, pp. 1933–1951.
• Romain Cosset and Damien Robert:
  Computing $(\ell,\ell)$-isogenies in polynomial time on Jacobians of genus 2 curves.
  Mathematics of Computation 84 (294), 2015, pp. 1953–1975.
• Henri Cohen, Simon Rubinstein-Salzedo and Frank Thorne:
  Identities for field extensions generalizing the Ohno-Nakagawa relations.
  Compositio Mathematica 151 (11), 2015, pp. 2059–2075.
• Andreas Enge:
  Bilinear pairings on elliptic curves.
  L'Enseignement Mathématique 61 (2), 2015, pp. 211–243.
• David Lubicz and Damien Robert:
  A generalisation of Miller's algorithm and applications to pairing computations on abelian varieties.
  Journal of Symbolic Computation 67, 2015, pp. 68–92.
• David Lubicz and Damien Robert:
  Computing separable isogenies in quasi-optimal time.
  LMS Journal of Computation and Mathematics 18, 2015, pp. 198–216.
• Enea Milio:
  A quasi-linear time algorithm for computing modular polynomials in dimension 2.
  LMS Journal of Computation and Mathematics 18, 2015, pp. 603–632.
• Aurel Page:
  Computing arithmetic Kleinian groups.
  Mathematics of Computation 84 (295), 2015, pp. 2361–2390.
• Pieter Rozenhart, Michael Jacobson and Renate Scheidler:
  Computing quadratic function fields with high 3-rank via cubic field tabulation.
  Rocky Mountain Journal of Mathematics 45 (6), 2015, pp. 1985–2022.

Conferences

• Guilhem Castagnos and Fabien Laguillaumie:
  Linearly Homomorphic Encryption from DDH.
  In Kaisa Nyberg (editors):
  Topics in Cryptology — CT-RSA 2015
  Lecture Notes in Computer Science vol. 9048.
  Springer International Publishing Switzerland, Cham 2015, pp. 487–505.
• Fredrik Johansson:
  Efficient implementation of elementary functions in the medium-precision range.
  In Jean-Michel Muller, Arnaud Tisserand and Julio Villalba (editors):
  22nd IEEE Symposium on Computer Arithmetic — ARITH 2015
  IEEE Computer Society, Los Alamitos 2015, pp. 83–89.

Patents

• Juan Lopez, Jean-Michel Camus, Jean-Marc Couveignes, Gilles Zemor and Marc Perret:
  Method and device for protecting the integrity of data transmitted over a network.
  United Stated of America patent no. US 9,009,839 B2, 2015.