Latest publication updates
 Better polynomials for GNFS, S. Bai, C. Bouvier, A. Kruppa, P. Zimmermann.
 Sparse Polynomial Systems with many Positive Solutions from Bipartite Simplicial Complexes, F. Bihan, P.J. Spaenlehauer.
 Imperfect Forward Secrecy: How DiffieHellman 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. ZanellaBéguelin, P. Zimmermann.
 Hardware and Software Accelerators for Sparse Linear Algebra over Finite Fields, H. Jeljeli.
 Interactive certificate for the verification of Wiedemann's Krylov sequence: application to the certification of the determinant, the minimal and the characteristic polynomials of sparse matrices, J.G. Dumas, E. Kaltofen, E. Thomé.
 Algorithms for integer factorization and discrete logarithms computation, C. Bouvier.
 The Tower Number Field Sieve, R. Barbulescu, P. Gaudry, T. Kleinjung.
 Improving NFS for the discrete logarithm problem in nonprime finite fields, R. Barbulescu, P. Gaudry, A. Guillevic, F. Morain.
 Selecting polynomials for the Function Field Sieve, R. Barbulescu.
 Fast arithmetic for faster integer multiplication, S. Covanov, E. Thomé.
 A Quadratically Convergent Algorithm for Structured LowRank Approximation, É. Schost, P.J. Spaenlehauer.
 Recent progress on the elliptic curve discrete logarithm problem, S. Galbraith, P. Gaudry.
 Montgomery's method of polynomial selection for the number field sieve, N. Coxon.
 Some experiments investigating a possible L(1/4) algorithm for the discrete logarithm problem in algebraic curves, .
 Improvements to the number field sieve for nonprime finite fields, R. Barbulescu, P. Gaudry, A. Guillevic.
 Computing (l,l)isogenies in polynomial time on Jacobians of genus 2 curves, R. Cosset, D. Robert.
 Accelerating Iterative SpMV for Discrete Logarithm Problem Using GPUs, H. Jeljeli.
News
 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 RSA1024.
 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: cmh1.0 has been released, and a new record of genus 2 class polynomials has been set.
 Jan 13th, 2014: belenios0.1 (online voting system) has been released.
 Nov 18th, 2013: cadonfs2.0 has been released.
 June 18th, 2013: A new quasipolynomial 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 coauthors.
 April 10th, 2013 : New record for discrete logarithm in finite field of characteristic 2: GF(2^809).
 October 23rd, 2012 : P. Gaudry, E. Thomé, P. Zimmermann and A. Kruppa have received the Prix La Recherche 2012.
 September 26th, 2012 : Marion Videau is on France 3 Lorraine TV.
 June 30th, 2012: RSA704 was factored by S. Bai, E. Thomé and P. Zimmermann using CADONFS.
 June 2012: The CATREL ANR project has just been accepted!
 June 22nd, 2012: We organize a scientific day of the Fédération Charles Hermite about Cryptography and Number Theory.

March 14th, 2012: gmpecm6.4.1
has been released.
It includes improvements based on the article written by Razvan Barbulescu, Joppe Bos, Cyril Bouvier, Thorsten Kleinjung, Peter Montgomery.  Oct 28th, 2011: cadonfs1.1 has been released.
 September 1921, 2011: ECC in Nancy.
 Jul 27th, 2011: Damien Robert received the IAEM award for his PhD thesis.
 Dec 10th, 2010: cadonfs1.0 has been released.
 Nov 22nd, 2010: gf2x1.0 has been released.
 July 1923, 2010 : ANTS IX in Nancy.
 April 8, 2010: Emmanuel Thomé received an award at the Grid'5000 Spring School 2010 in Lille
 March 27, 2010: a 54digit factor of F12 has been found with GMPECM
 December 12, 2009: RSA768 challenge has been solved!
Last modification: Sun 08 Nov 2015 05:07:54 PM CET
© 2006– members of the projectteam ; valid XHTML 1.0, valid CSS
© 2006– members of the projectteam ; valid XHTML 1.0, valid CSS