Note: some of the links below point to external sites, and eventually go stale. Too bad.
New stuff ! #
2020/02/28: New computational record, the factorization of RSA-250. (I didn’t follow the news coverage.)
2019/12/02: New computational record, with the computation of discrete logarithms modulo a 240-bit prime field, and the factorization of RSA-240. Some news coverage: Le Monde; Ars Technica; New Scientist.
2016/10/05: New computational record for a hidden-SNFS 1024-bit discrete logarithm. A non-technical description is here, and institute-level coverage is here and here. Some news coverage: The Register; Le Monde; Ars Technica; PC World; silicon.fr; 01net;
2015/05/20: The LOGJAM attack on TLS is out! Using Cado-NFS, we demonstrated the easy computation of individual logs for widely deployed weak DH keys. Some news coverage: Spiegel; Wall Street Journal; BBC News; ars technica; The Register; focus.de; Bloomberg; Wired; Tom’s hardware; ComputerWorld; The Next Web; oszone.net; idg.se; silicon.fr; ZDnet; ZDnet France; itexpresso.fr; Westdeutsche Zeitung; derstandard.at; bit-tech.net; threatpost; softpedia; futurezone.at; iguru.gr; digi.no; datenschutz notizen; nextinpact; USA Today; engadget; techrepublic; v3.co.uk; tom’s guide; darkreading; thehill; govinfo security; infosecurity magazine; SC Magazine; top tech; Business Insider; iThome (Taiwan).
2014/05/12: More news on the quasi-polynomial algorithm for the DLP over small characteristic finite fields:
- The paper was awarded the Eurocrypt 2014 Best paper award.
- News of this work has reached the general press: Le Monde; France Inter; PC Inpact; CNRS press release.
2014/05/07: I was awarded the Grand prix de la recherche 2014 de l’Association des Amis de l’Université de Lorraine (Loria web site)
2014/03/29: Announce of record computation for genus 2 complex multiplication. (see my computations page).
2013/06/18: A new heuristic quasi-polynomial algorithm for the DLP over small characteristic finite fields. This is a significant breakthrough compared to previous state-of-the-art, for a problem whose whose complexity has stayed above the L(1/3) mark for 30 years. See also there, or there.