Latest publication updates

A short-list of pairing-friendly curves resistant to Special TNFS at the 128-bit security level, A. Guillevic.
Cocks-Pinch curves of embedding degrees five to eight and optimal ate pairing computation, A. Guillevic, S. Masson, E. Thomé.
Isogeny graphs with maximal real multiplication, S. Ionica, E. Thomé.
Computing AES related-key differential characteristics with constraint programming, D. Gérault, P. Lafourcade, M. Minier, C. Solnon.
Analysis on Boolean function in a restricted (biased) domain, S. Maitra, B. Mandal, T. Martinsen, D. Roy, P. Stanica.
Vectorial Boolean Functions with Very Low Differential-Linear Uniformity Using Maiorana-McFarland Type Construction, D. Tang, B. Mandal, S. Maitra.
A Tale of Three Signatures: practical attack of ECDSA with wNAF, G. De Micheli, R. Piau, C. Pierrot.
Forkcipher: A New Primitive for Authenticated Encryption of Very Short Messages, E. Andreeva, V. Lallemand, A. Purnal, R. Reyhanitabar, A. Roy, D. Vizár.
Breaking the encryption scheme of the Moscow Internet voting system, P. Gaudry, A. Golovnev.
Verifiable Delay Functions from Supersingular Isogenies and Pairings, L. De Feo, S. Masson, C. Petit, A. Sanso.
Cryptanalysis of SKINNY in the Framework of the SKINNY 2018-2019 Cryptanalysis Competition, P. Derbez, V. Lallemand, A. Udovenko.
On the Alpha Value of Polynomials in the Tower Number Field Sieve Algorithm, A. Guillevic, S. Singh.
Algorithmic aspects of elliptic bases in finite field discrete logarithm algorithms, A. Joux, C. Pierrot.
Modular polynomials on Hilbert surfaces, E. Milio, D. Robert.
CADO-NFS, An Implementation of the Number Field Sieve Algorithm, T. CADO-NFS Development Team.
Parallel Structured Gaussian Elimination for the Number Field Sieve, C. Bouillaguet, P. Zimmermann.
Faster individual discrete logarithms in finite fields of composite extension degree, A. Guillevic.

News

February 2020 : New integer factoring record (RSA-250) (technical announcement);
December 2019 : New computational records for integer factoring (RSA-240) and finite field discrete logarithms (DLP-240). (technical announcement); press: Le Monde, Ars Technica, New Scientist. For an introduction to NFS, here are slides and SageMath code (.zip).
November 22, 2019: Simon Abelard receives the PhD prize of the Université de Lorraine for his PhD thesis Counting points on hyperelliptic curves in large characteristic : algorithms and complexity.
August 2019: Pierrick Gaudry found a vulnerability in the encryption scheme of the voting system of Moscow with press coverage from BBC/Russian, Meduza, L'Est Républicain, RTL, France 24, ...
September 7, 2018: Simon Abelard defended his PhD thesis on Point-counting on hyperelliptic curves defined over finite fields of large characteristic: algorithms and complexities. See this link.
June 15, 2018: the paper A New Family of Pairing-Friendly Curves by Michael Scott and Aurore Guillevic jointly received the best paper award at the WAIFI 2018 conference in Bergen, Norway.
June 5, 2018: Svyatoslav Covanov defended his PhD thesis on Multiplication algorithms: bilinear complexity and fast asymptotic methods.
April 23–28, 2017: Journées Codage & Cryptographie in La Bresse (Vosges, France).
October 2016: Cryptanalysis of trapdoored 1024-bit primes
January 2016: The CARAMBA team has just been created. It is a follow-up to CARAMEL.
May 2015: The Logjam attack concerns 8% of the web. See the article. For this work, we got a Pwnie Award and the Best Paper Award at the CCS 2015 conference.
February 2015: the article Better polynomials for GNFS has been accepted to Math. Comp. This new algorithm reduces by a factor 2 the runtime estimates for RSA-1024.
November 2014: Razvan Barbulescu received the award ``Prix Le Monde de la recherche universitaire'' for his PhD thesis prepared in the team.
November 2014: Emmanuel Thomé received the award ``Prix régional du chercheur''.
June 24th, 2014: New record for discrete logarithm in a finite field of the form GF(p^2).
June 11th, 2014: New record for discrete logarithm in a prime finite field of 180 decimal digits.
Mar 29th, 2014: cmh-1.0 has been released, and a new record of genus 2 class polynomials has been set.
Jan 13th, 2014: belenios-0.1 (online voting system) has been released.
Nov 18th, 2013: cado-nfs-2.0 has been released.
June 18th, 2013: A new quasi-polynomial algorithm for the DLP over small characteristic finite fields.
June 6th, 2013: A new book about Sage has just appeared; Paul Zimmermann is one of the co-authors.
April 10th, 2013 : New record for discrete logarithm in finite field of characteristic 2: GF(2^809).
News from 2012 and before are on the old website for CARAMEL.

a quartic a belgian FFT transform a genus 2 curve