Overall Objectives
Research Program
Application Domains
Highlights of the Year
New Software and Platforms
New Results
Bilateral Contracts and Grants with Industry
Partnerships and Cooperations
XML PDF e-pub
PDF e-Pub


Publications of the year

Doctoral Dissertations and Habilitation Theses

L. Grémy.
Sieve algorithms for the discrete logarithm in medium characteristic finite fields, Université de Lorraine, September 2017.

Articles in International Peer-Reviewed Journals

M. Ishii, J. Detrey, P. Gaudry, A. Inomata, K. Fujikawa.
Fast Modular Arithmetic on the Kalray MPPA-256 Processor for an Energy-Efficient Implementation of ECM, in: IEEE Transactions on Computers, December 2017, vol. 66, no 12, pp. 2019-2030. [ DOI : 10.1109/TC.2017.2704082 ]
M. Minier.
Improving impossible-differential attacks against Rijndael-160 and Rijndael-224, in: Designs, Codes and Cryptography, January 2017, vol. 82, no 1-2, pp. 117 - 129. [ DOI : 10.1007/s10623-016-0206-7 ]
J.-P. Échard, P. Gaudry.
An harmonious encoding of instrument values by a 19th century Parisian violin dealer, in: Cryptologia, 2017, vol. 41, no 5, pp. 448-458. [ DOI : 10.1080/01611194.2016.1257524 ]

International Conferences with Proceedings

M. Alaggan, M. Cunche, M. Minier.
Non-interactive (t, n)-Incidence Counting from Differentially Private Indicator Vectors, in: 3rd International Workshop on Security and Privacy Analytics (IWSPA 2017), Scottsdale, United States, March 2017.
J. Fried, P. Gaudry, N. Heninger, E. Thomé.
A kilobit hidden SNFS discrete logarithm computation, in: 36th Annual International Conference on the Theory and Applications of Cryptographic Techniques - Eurocrypt 2017, Paris, France, J.-S. Coron, J. B. Nielsen (editors), Advances in Cryptology – EUROCRYPT 2017, Springer, April 2017, vol. 10210, [ DOI : 10.1007/978-3-319-56620-7_8 ]
D. Gerault, M. Minier, C. Solnon.
Using Constraint Programming to solve a Cryptanalytic Problem, in: IJCAI 2017 - International Joint Conference on Artificial Intelligence - Sister Conference Best Paper Track, Melbourne, Australia, August 2017, 5 p.
L. Grémy, A. Guillevic, F. Morain, E. Thomé.
Computing discrete logarithms in GF(p6), in: 24th Annual Conference on Selected Areas in Cryptography, Ottawa, Canada, August 2017.
V. Lefèvre, P. Zimmermann.
Optimized Binary64 and Binary128 Arithmetic with GNU MPFR, in: 24th IEEE Symposium on Computer Arithmetic (ARITH 24), London, United Kingdom, July 2017.
S. Perdrix, L. Sanselme.
Determinism and Computational Power of Real Measurement-based Quantum Computation, in: FCT'17- 21st International Symposium on Fundamentals of Computation Theory, Bordeaux, France, September 2017, [ DOI : 10.1007/978-3-662-55751-8_31 ]

Conferences without Proceedings

L. Chen, S. Covanov, D. Mohajerani, M. Moreno Maza.
Big Prime Field FFT on the GPU, in: ISSAC 2017, Kaiserslautern, Germany, July 2017.

Scientific Books (or Scientific Book chapters)

R. P. Brent, A. Kruppa, P. Zimmermann.
FFT extension for algebraic-group factorization algorithms, in: Topics in Computational Number Theory Inspired by Peter L. Montgomery, J. W. Bos, A. K. Lenstra (editors), Cambridge University Press, 2017, pp. 189-205.
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, P. Zimmermann.
Mathematical Computation with SageMath (temporary title), published by the authors, 2017, forthcoming.
E. Thomé.
A modified block Lanczos algorithm with fewer vectors, in: Topics in Computational Number Theory inspired by Peter L. Montgomery, Cambridge University Press, 2017, [ DOI : 10.1017/9781316271575.008 ]

Scientific Popularization

P. Gaudry, J. Jongwane.
À propos du vote par Internet, in: Interstices, March 2017.

Other Publications

S. Abelard, P. Gaudry, P.-J. Spaenlehauer.
Improved Complexity Bounds for Counting Points on Hyperelliptic Curves, October 2017, working paper or preprint.
S. Covanov.
Improved method for finding optimal formulae for bilinear maps in a finite field, November 2017, working paper or preprint.
P. Gaudry.
Some ZK security proofs for Belenios, 2017, working paper or preprint.
L. Grémy, A. Guillevic, F. Morain.
Breaking DLP in GF(p5) using 3-dimensional sieving, July 2017, working paper or preprint.
A. Guillevic.
Faster individual discrete logarithms with the QPA and NFS variants, August 2017, working paper or preprint.
P. Kilicer, H. Labrande, R. Lercier, C. Ritzenthaler, J. Sijsling, M. Streng.
Plane quartics over Q with complex multiplication, 2017, - 34 pages.
E. Milio.
Computing isogenies between Jacobian of curves of genus 2 and 3, September 2017, working paper or preprint.
E. Milio, D. Robert.
Modular polynomials on Hilbert surfaces, September 2017, working paper or preprint.
References in notes
D. Adrian, K. Bhargavan, Z. Durumeric, P. Gaudry, M. Green, J. Alex Halderman, N. Heninger, D. Springall, E. Thomé, L. Valenta, B. VanderSloot, E. Wustrow, S. Zanella-Béguelin, P. Zimmermann.
Imperfect Forward Secrecy: How Diffie-Hellman fails in practice, in: CCS'15, ACM, 2015, pp. 5–17.
Agence nationale de la sécurité des systèmes d'information.
Référentiel général de sécurité, annexe B1, 2014, Version 2.03.
R. Barbulescu, J. Detrey, N. Estibals, P. Zimmermann.
Finding Optimal Formulae for Bilinear Maps, in: International Workshop of the Arithmetics of Finite Fields, Bochum, Germany, F. Özbudak, F. Rodríguez-Henríquez (editors), Lecture Notes in Computer Science, Ruhr Universitat Bochum, July 2012, vol. 7369. [ DOI : 10.1007/978-3-642-31662-3_12 ]
R. Barbulescu, P. Gaudry, A. Joux, E. Thomé.
A heuristic quasi-polynomial algorithm for discrete logarithm in finite fields of small characteristic, in: Eurocrypt 2014, Copenhagen, Denmark, P. Q. Nguyen, E. Oswald (editors), Springer, May 2014, vol. 8441, pp. 1-16. [ DOI : 10.1007/978-3-642-55220-5_1 ]
S. Covanov, E. Thomé.
Fast integer multiplication using generalized Fermat primes, January 2016, working paper or preprint.
J.-C. Faugère, P.-J. Spaenlehauer, J. Svartz.
Sparse Gröbner bases: the unmixed case, in: ISSAC 2014, K. Nabeshima (editor), ACM, 2014, pp. 178–185, Proceedings.
J.-C. Faugère, M. Safey El Din, P.-J. Spaenlehauer.
Gröbner Bases of Bihomogeneous Ideals generated by Polynomials of Bidegree (1,1): Algorithms and Complexity, in: J. Symbolic Comput., 2011, vol. 46, no 4, pp. 406–437.
P. Gaudry, É. Schost.
Genus 2 point counting over prime fields, in: J. Symbolic Comput., 2011, vol. 47, no 4, pp. 368–400.
R. Granger, T. Kleinjung, J. Zumbrägel.
On the Powers of 2, 2014, Cryptology ePrint Archive report.
A. Guillevic.
Computing Individual Discrete Logarithms Faster in GF(pn) with the NFS-DL Algorithm, in: Asiacrypt 2015, Auckland, New Zealand, T. Iwata, J. H. Cheon (editors), Lecture Notes in Computer Science, Springer, November 2015, vol. 9452, pp. 149-173. [ DOI : 10.1007/978-3-662-48797-6_7 ]
F. Göloglu, R. Granger, J. McGuire.
On the Function Field Sieve and the Impact of Higher Splitting Probabilities, in: CRYPTO 2013, R. Canetti, J. A. Garay (editors), Lecture Notes in Comput. Sci., Springer–Verlag, 2013, vol. 8043, pp. 109–128, Proceedings, Part II.
A. Joux.
A New Index Calculus Algorithm with Complexity L(1/4+o(1)) in Small Characteristic, in: Selected Areas in Cryptography – SAC 2013, T. Lange, K. Lauter, P. Lisoněk (editors), Lecture Notes in Comput. Sci., Springer–Verlag, 2014, vol. 8282, pp. 355–379, Proceedings.
T. Kleinjung, K. Aoki, J. Franke, A. K. Lenstra, E. Thomé, J. Bos, P. Gaudry, A. Kruppa, P. L. Montgomery, D. A. Osvik, H. te Riele, A. Timofeev, P. Zimmermann.
Factorization of a 768-bit RSA modulus, in: CRYPTO 2010, T. Rabin (editor), Lecture Notes in Comput. Sci., Springer–Verlag, 2010, vol. 6223, pp. 333–350, Proceedings.
N. Koblitz, A. J. Menezes.
A Riddle Wrapped in an Enigma, 2015, Cryptology ePrint Archive report.
A. Langley, M. Hamburg, S. Turner.
Elliptic Curves for Security, 2016, RFC 7748.
M. Minier, R. C.-W. Phan.
Tuple Cryptanalysis: Slicing and Fusing Multisets, in: Paradigms in Cryptology – Mycrypt 2016, Kuala Lumpur, Malaysia, R. C.-W. Phan, M. Yung (editors), Lecture Notes in Computer Science, Springer, December 2016, vol. 10311, pp. 294-320. [ DOI : 10.1007/978-3-319-61273-7 ]
National Institute of Standards and Technology.
Transitions: Recommendation for Transitioning the Use of Cryptographic Algorithms and Key Lengths, 2011, First revision.
National Security Agency.
Cryptography Today, 2015.