Latest publication updates
- And Rijndael? Automatic Related-key Differential Analysis of Rijndael, L. Rouquette, D. Gerault, M. Minier, C. Solnon.
- A survey of elliptic curves for proof systems, D.F. Aranha, y. El Housni, A. Guillevic.
- Hard Homogeneous Spaces from the Class Field Theory of Imaginary Hyperelliptic Function Fields, P.-J. Spaenlehauer, A. Leudière.
- Is the JCJ voting system really coercion-resistant?, V. Cortier, P. Gaudry, Q. yang.
- Parallel integer multiplication, S. Vivien.
- Co-factor clearing and subgroup membership testing on pairing-friendly curves, y. El Housni, A. Guillevic, T. Piellard.
- The State of the Art in Integer Factoring and Breaking Public-Key Cryptography, F. Boudot, P. Gaudry, A. Guillevic, N. Heninger, E. Thomé, P. Zimmermann.
- Accuracy of Mathematical Functions in Single, Double, Extended Double and Quadruple Precision, V. Innocente, P. Zimmermann.
- Non-triangular self-synchronizing stream ciphers, J. Francq, L. Besson, P. Huynh, P. Guillot, G. Millérioux, M. Minier.
- Symbolic Computation and Complexity Analyses for Number Theory and Cryptography, A. Le Gluher.
- Quantum Linearization Attacks, X. Bonnetain, G. Leurent, M. Naya-Plasencia, A. Schrottenloher.
- QCB: Efficient Quantum-Secure Authenticated Encryption, R. Bhaumik, X. Bonnetain, A. Chailloux, G. Leurent, M. Naya-Plasencia, A. Schrottenloher, y. Seurin.
- Lattice Enumeration for Tower NFS: a 521-bit Discrete Logarithm Computation, G. de Micheli, P. Gaudry, C. Pierrot.
- CTET+: A Beyond-Birthday-Bound Secure Tweakable Enciphering Scheme Using a Single Pseudorandom Permutation, B. Cogliati, J. Ethan, V. Lallemand, B. Lee, J. Lee, M. Minier.
- History of Cryptographic Key Sizes, N.P. Smart, E. Thomé.
- A privacy attack on the Swiss Post e-voting system, V. Cortier, A. Debant, P. Gaudry.
- Quantum Period Finding against Symmetric Primitives in Practice, X. Bonnetain, S. Jaques.
News (pre-twitter)
- June 12, 2020: Sandra Rasoamiaramanana defended her PhD thesis on Délivrance de contextes sécurisés par des approches hybrides.
-
June 2020: three papers accepted at Crypto 2020 and one paper at Africacrypt 2020.
- Boudot, Gaudry, Guillevic, Heninger, Thomé, Zimmermann, Comparing the difficulty of factorization and discrete logarithm: a 240-digit experiment, ePrint 2020/697, DOI 10.1007/978-3-030-56880-1_3, Session Cryptanalysis 2
- Derbez, Huynh, Lallemand, Naya-Plasencia, Perrin, Schrottenloher, Cryptanalysis Results on Spook, ePrint 2020/309, DOI 10.1007/978-3-030-56877-1_13, Session Cryptanalysis 1
- De Micheli, Gaudry, Pierrot, Asymptotic complexities of discrete logarithm algorithms in pairing-relevant finite fields, ePrint 2020/329, DOI 10.1007/978-3-030-56880-1_2, Session Cryptanalysis 2
- De Micheli, Piau, Pierrot, A Tale of Three Signatures: practical attack of ECDSA with wNAF, ePrint 2019/861, DOI 10.1007/978-3-030-51938-4_18, slides and videos of the conference.
- February 2020 : New integer factoring record (RSA-250) (technical announcement); (reproducibility data).
- December 2019 : New computational records for integer factoring (RSA-240) and finite field discrete logarithms (DLP-240). (technical announcement); (article) ; (reproducibility data); 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.
![]() |
![]() |
![]() |
![]() |
Last modification: Thu 30 Jun 2022 09:27:41 AM 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