BOUILLAGUET Charles
Associate Professor
Team : ALMASTY
Tel: +33 1 44 27 31 63, Charles.Bouillaguet (at) nulllip6.fr
https://lip6.fr/Charles.Bouillaguet
Team : ALMASTY
- Sorbonne Université - LIP6
Boîte courrier 169
Couloir 24-25, Étage 4, Bureau 410
4 place Jussieu
75252 PARIS CEDEX 05
FRANCE
Tel: +33 1 44 27 31 63, Charles.Bouillaguet (at) nulllip6.fr
https://lip6.fr/Charles.Bouillaguet
3 PhD students (Supervision / Co-supervision)
- ALHARBI Ahmed Khulaif : Computational Complexity Models in The Cloud
- HAMDAD Mickäel : Algorithmes pour le problème des plus proches voisins et application en cryptanalyse
- SAUVAGE Julia : Vers des outils de référence et de nouveaux algorithmes pour la résolution des systèmes polynomiaux en cryptographie
2011-2023 Publications
-
2023
- Ch. Bouillaguet, A. Fleury, P.‑A. Fouque, P. Kirchner : “We Are on the Same Side. Alternative Sieving Strategies for the Number Field Sieve”, (2023)
- Ch. Bouillaguet : “Plateformes de TP interactives pour l’enseignement de la cryptographie”, Rendez-vous de la recherche et de l’enseignement de la sĂ©curitĂ© des systèmes d’information (RESSI 2023), Neuvy-sur-Barangeon, France (2023)
-
2022
- Ch. Bouillaguet : “Cryptanalysis of an Outsourced Modular Inversion Protocol”, (2022)
- Ch. Bouillaguet, C. Delaplace, M. Trimoska : “A Simple Deterministic Algorithm for Systems of Quadratic Polynomials over F 2”, Symposium on Simplicity in Algorithms (SOSA), Alexandria, United States, pp. 285-296 (2022)
- Ch. Bouillaguet, F. Martinez, D. Vergnaud : “Cryptanalysis of Modular Exponentiation Outsourcing Protocols”, The Computer Journal, vol. 65 (9), pp. 2299–2314, (Oxford University Press (UK)) (2022)
-
2021
- Ch. Bouillaguet, C. Delaplace, A. Joux : “Algorithms for Sparse Random 3XOR: The Low-Density Case”, (2021)
- M. Bouam, Ch. Bouillaguet, C. Delaplace, C. NoĂ»s : “Computational Records with Aging Hardware: Controlling Half the Output of SHA-256”, Parallel Computing, pp. 102804, (Elsevier) (2021)
-
2020
- Ch. Bouillaguet, F. Martinez, J. Sauvage : “Practical seed-recovery for the PCG Pseudo-Random Number Generator”, IACR Transactions on Symmetric Cryptology, (Ruhr Universität Bochum) (2020)
-
2011
- Ch. Bouillaguet, J.‑Ch. Faugère, P.‑A. Fouque, L. Perret : “Practical Cryptanalysis of the Identification Scheme Based on the Isomorphism of Polynomial With One Secret Problem”, 14th IACR International Conference on Practice and Theory of Public Key Cryptography - PKC 2011, vol. 6571, Lecture Notes in Computer Science, Taormina, Italy, pp. 473-493, (Springer) (2011)