Latest publication updates
- A New Ranking Function for Polynomial Selection in the Number Field Sieve, N. David, P. Zimmermann.
- On the Alpha Value of Polynomials in the Tower Number Field Sieve Algorithm, A. Guillevic, S. Singh.
- Breaking the encryption scheme of the Moscow internet voting system, P. Gaudry.
- CADO-NFS, An Implementation of the Number Field Sieve Algorithm, . . 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.
- Belenios: a simple private and verifiable electronic voting system, V. Cortier, P. Gaudry, S. Glondu.
- Isogeny graphs with maximal real multiplication, S. Ionica, E. Thomé.
- Improved Complexity Bounds for Counting Points on Hyperelliptic Curves, S. Abelard, P. Gaudry, P.-J. Spaenlehauer.
- Imperfect forward secrecy: How Diffie-Hellman fails in practice, D. Adrian, K. Bhargavan, Z. Durumeric, P. Gaudry, M. Green, J.A. Halderman, N. Heninger, D. Springall, E. Thomé, L. Valenta, B. Vandersloot, E. Wustrow, S. Zanella-Béguelin, P. Zimmermann.
- Computational Mathematics with SageMath, P. Zimmermann, A. Casamayou, N. Cohen, G. Connan, T. Dumont, L. Fousse, F. Maltey, M. Meulien, M. Mezzarobba, C. Pernet, N.M. Thiery, E. Bray, J. Cremona, M. Forets, A. Ghitza, H. Thomas.
- Improved method for finding optimal formulae for bilinear maps in a finite field, S. Covanov.
- A Fast Randomized Geometric Algorithm for Computing Riemann-Roch Spaces, A. Le Gluher, P.-J. Spaenlehauer.
- Counting points on hyperelliptic curves with explicit real multiplication in arbitrary genus, S. Abelard.
- Polynomial Time Bounded Distance Decoding near Minkowski's Bound in Discrete Logarithm Lattices, L. Ducas, C. Pierrot.
- Counting points on hyperelliptic curves in large characteristic : algorithms and complexity, S. Abelard.
- Counting points on genus-3 hyperelliptic curves with explicit real multiplication, S. Abelard, P. Gaudry, P.-J. Spaenlehauer.
News
- 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.
Last modification: Wed 04 Sep 2019 05:07:33 PM CEST
© 2006– members of the project-team ; valid XHTML 1.0, valid CSS
© 2006– members of the project-team ; valid XHTML 1.0, valid CSS