Antoine Joux


Academic Affiliation and address

Current Position Formerly
Cryptology Chair - Fondation Partenariale de l'UPMC
Laboratoire d'informatique de Paris 6
Boite courrier 169, Couloir 26-00, Etage 3, Bureau 315
4 place Jussieu, 75252 PARIS CEDEX 05
Professeur associé (PAST)
Laboratoire PRISM, Equipe CRYPTO
Université de Versailles Saint-Quentin-en-Yvelines

Other activities

Current Position Formerly
CryptoExperts
Senior Crypto-Security Expert
41 Boulevard des Capucines, 6th Floor
75002 Paris, France
DGA

DCSSI (now called ANSSI)


PhD Students

Current Students
Former Students
  • Anja Becker (PhD 2012)
  • Jean-René Reinhard (PhD 2011)
  • Vanessa Vitse (PhD 2011)
  • Pascal Delaunay (PhD 2011)
  • Sorina Ionica (PhD 2010)
  • Aurélie Bauer (PhD 2008)
  • Frédéric Muller (PhD 2005)
  • Eliane Jaulmes (PhD 2003)

Research Topics (Complete bibliography by date)

Lattice Reduction (Related bibliography)

Lattice reduction was the main topic of my PhD Thesis which was accomplished under the supervision of Jacques Stern at the Ecole Normale Supérieure.
A recent contribution to this topic is the application, together with Nicolas Gama and Anja Backer, of the decomposition method to the problem of searching short or close vectors.

Discrete Logarithms (Related bibliography)

Together with Reynald Lercier, we started working on the topic of discrete logarithms in finite fields in 1998. Recently, I contributed to the discovery of a quasi-polynomial discrete logarithm algorithm in small characteristic finite fields.

Elliptic Curves (Related bibliography)

Since their introduction in cryptography by Koblitz and Miller, elliptic curves have been a topic of growing importance in the field. Until recently, most of my work about elliptic curve was of a constructive nature (point counting, use of pairings, ...). However, in the last two years, together with Vanessa Vitse, we published two articles about index calculus in elliptic curves over small degree extension fields.

Collisions and Collision-related Algorithms (Related bibliography)

This research topic includes several main branches such as differential collisions or generic techniques.
The most recent branch consists of several algorithms which make use of the decomposition technique to solve several combinatorial algorithms with reduced average-case complexity. More precisely, this technique was applied to subset-sum problems, decoding of random binary codes and short/close vector problems in lattices.

Various Cryptanalytic work (Related bibliography)

This part of the bibliography includes many cryptanalysis works that use a variety of techniques and are not necessarily related to each other. One tool which is used quite frequently is the resolution of polynomial systems of equations with Gröbner basis algorithms.
Last modified: Wed Dec 4 11:03:11 CET 2013