Workshop on Number-Theoretic Algorithms for Asymmetric Cryptology

With the support of the Labex DigiCosme, team GRACE hosted an international workshop on Number-Theoretic Algorithms for Asymmetric Cryptology on the 20th and 21st of June, 2013.

Talks

Razvan Barbulescu (LORIA)
A quasi-polynomial algorithm for discrete logarithms in finite fields of small characteristic. Slides / Preprint / Ellipticnews blog writeup
Andreas Enge (INRIA Bordeaux–Sud-Ouest)
Class Polynomials for Abelian Surfaces. Slides / Preprint
Steven Galbraith (Auckland)
Computational problems and lattices, and public key signatures. Slides (pdf)
Florian Hess (Oldenburg)
Pairing inversion, and towers of curves. Slides (pdf)
Antoine Joux (Cryptoexperts and UVSQ)
Discrete logarithms in small characteristic finite fields: An L(1/4+o(1)) algorithm. Slides / Preprint
Vadim Lyubashevsky (INRIA Paris–Rocquencourt and ENS Paris)
Lattice signatures and bimodal gaussians. Slides / Preprint
Ben Smith (INRIA Saclay–Île-de-France and École polytechnique)
Q-curves and faster Elliptic Curve Diffie-Hellman key exchange. Slides / Preprint

Participants
Daniel Augot, Shi Bai, Jean-Claude Bajard, Razvan Barbulescu, Peter Birkner, Cyril Bouvier, John Boxall, Svyatoslav Covanov, Luca De Feo, Cyril Hugounenq, Nicolas Delfosse, Iwan Duursma, Andreas Enge, Jean-Pierre Flori, Georg Fuchsbauer, Steven Galbraith, Cécile Gonçalves, Eleonora Guerrini, Aurore Guillevic, Florian Hess, Laurent Imbert, Sorina Ionica, Hamza Jeljeli, Antoine Joux, Alexander Kruppa, Fabien Laguillaumie, Tancrède Lepoint, Vadim Lyubashevsky, François Morain, Olivier Orcière, Matthias Peter, Cécile Pierrot, Julia Pieltant, Thomas Plantard, Thomas Prest, Guenael Renault, Benjamin Smith, Emmanuel Thomé, Bastien Vialla, Marion Videau.