Latest publication updates
- Computing Small Certificates of Inconsistency of Quadratic Fewnomial Systems, J.-C. Faugere, P.-J. Spaenlehauer, J. Svartz.
- Computing Jacobi's θ in quasi-linear time, H. Labrande.
- Solving discrete logarithms on a 170-bit MNT curve by pairing reduction, A. Guillevic, F. Morain, E. Thomé.
- Factorisation of RSA-220 with CADO-NFS, S. Bai, P. Gaudry, A. Kruppa, E. Thomé, P. Zimmermann.
- Critical Point Computations on Smooth Varieties: Degree and Complexity bounds, M. Safey El Din, P.-J. Spaenlehauer.
- Sparse Polynomial Systems with many Positive Solutions from Bipartite Simplicial Complexes, F. Bihan, P.-J. Spaenlehauer.
- Fast Modular Arithmetic on the Kalray MPPA-256 Processor for an Energy-Efficient Implementation of ECM, M. Ishii, P. Gaudry, A. Inomata, K. Fujikawa.
- Computing theta functions in quasi-linear time in genus 2 and above, H. Labrande, E. Thomé.
- Linear Time Interactive Certificates for the Minimal Polynomial and the Determinant of a Sparse Matrix, J.-G. Dumas, E. Kaltofen, E. Thomé, G. Villard.
- Fast integer multiplication using generalized Fermat primes, S. Covanov, E. Thomé.
- A modified block Lanczos algorithm with fewer vectors, E. Thomé.
- Recent progress on the elliptic curve discrete logarithm problem, S. Galbraith, P. Gaudry.
- Collecting relations for the Number Field Sieve in GF(p^6), P. Gaudry, L. Grémy, M. Videau.
- Better polynomials for GNFS, S. Bai, C. Bouvier, A. Kruppa, P. Zimmermann.
- The Tower Number Field Sieve, R. Barbulescu, P. Gaudry, T. Kleinjung.
- 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.
- Hardware and Software Accelerators for Sparse Linear Algebra over Finite Fields, H. Jeljeli.
News
- 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: Thu 07 Jul 2016 02:54:00 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