Using First-Order Theorem Provers in the Jahob Data Structure Verification System. - Charles Bouillaguet; Viktor Kuncak; Thomas Wies; Karen Zee; Martin C. Rinard (VMCAI, 2007)

Second Preimage Attacks on Dithered Hash Functions. - Charles Bouillaguet; Pierre-Alain Fouque; Adi Shamir; Sébastien Zimmer (IACR Cryptol. ePrint Arch., 2007)

Second Preimage Attacks on Dithered Hash Functions. - Elena Andreeva 001; Charles Bouillaguet; Pierre-Alain Fouque; Jonathan J. Hoch; John Kelsey; Adi Shamir; Sébastien Zimmer (EUROCRYPT, 2008)

Analysis of the Collision Resistance of RadioGatúnUsing Algebraic Techniques. - Charles Bouillaguet; Pierre-Alain Fouque (Selected Areas in Cryptography, 2008)

Herding, Second Preimage and Trojan Message Attacks beyond Merkle-Damgård. - Elena Andreeva 001; Charles Bouillaguet; Orr Dunkelman; John Kelsey (Selected Areas in Cryptography, 2009)

On the Security of Iterated Hashing based on Forgery-resistant Compression Functions. - Charles Bouillaguet; Orr Dunkelman; Pierre-Alain Fouque; Antoine Joux (IACR Cryptol. ePrint Arch., 2009)

Attacks on Hash Functions based on Generalized Feistel - Application to Reduced-Round Lesamnta and SHAvite-3512. - Charles Bouillaguet; Orr Dunkelman; Gaëtan Leurent; Pierre-Alain Fouque (IACR Cryptol. ePrint Arch., 2009)

Differential-Algebraic Algorithms for the Isomorphism of Polynomials Problem. - Charles Bouillaguet; Jean-Charles Faugère; Pierre-Alain Fouque; Ludovic Perret (IACR Cryptol. ePrint Arch., 2009)

A Family of Weak Keys in HFE (and the Corresponding Practical Key-Recovery). - Charles Bouillaguet; Pierre-Alain Fouque; Antoine Joux; Joana Treger (IACR Cryptol. ePrint Arch., 2009)

Fast Exhaustive Search for Polynomial Systems in F2. - Charles Bouillaguet; Hsieh-Chung Chen; Chen-Mou Cheng; Tung Chou; Ruben Niederhagen; Adi Shamir; Bo-Yin Yang (CHES, 2010)

Another Look at Complementation Properties. - Charles Bouillaguet; Orr Dunkelman; Gaëtan Leurent; Pierre-Alain Fouque (FSE, 2010)

Attacks on Hash Functions Based on Generalized Feistel: Application to Reduced-Round Lesamnta and SHAvite-3512. - Charles Bouillaguet; Orr Dunkelman; Gaëtan Leurent; Pierre-Alain Fouque (Selected Areas in Cryptography, 2010)

Security Analysis of SIMD. - Charles Bouillaguet; Pierre-Alain Fouque; Gaëtan Leurent (Selected Areas in Cryptography, 2010)

Fast Exhaustive Search for Polynomial Systems in F2. - Charles Bouillaguet; Chen-Mou Cheng; Tung Chou; Ruben Niederhagen; Adi Shamir; Bo-Yin Yang (IACR Cryptol. ePrint Arch., 2010)

Low Data Complexity Attacks on AES. - Charles Bouillaguet; Patrick Derbez; Orr Dunkelman; Nathan Keller; Vincent Rijmen; Pierre-Alain Fouque (IACR Cryptol. ePrint Arch., 2010)

Practical Key-Recovery for All Possible Parameters of SFLASH. - Charles Bouillaguet; Pierre-Alain Fouque; Gilles Macario-Rat (ASIACRYPT, 2011)

Automatic Search of Attacks on Round-Reduced AES and Applications. - Charles Bouillaguet; Patrick Derbez; Pierre-Alain Fouque (CRYPTO, 2011)

Practical Cryptanalysis of the Identification Scheme Based on the Isomorphism of Polynomial with One Secret Problem. - Charles Bouillaguet; Jean-Charles Faugère; Pierre-Alain Fouque; Ludovic Perret (Public Key Cryptography, 2011)

New Insights on Impossible Differential Cryptanalysis. - Charles Bouillaguet; Orr Dunkelman; Pierre-Alain Fouque; Gaëtan Leurent (Selected Areas in Cryptography, 2011)

Algorithms for some hard problems and cryptographic attacks against specific cryptographic primitives. (Études d'hypothèses algorithmiques et attaques de primitives cryptographiques). - Charles Bouillaguet (2011)

Graph-Theoretic Algorithms for the "Isomorphism of Polynomials" Problem. - Charles Bouillaguet; Pierre-Alain Fouque; Amandine Véber (EUROCRYPT, 2013)

Fast Exhaustive Search for Quadratic Systems in $$ mathbb {F}_{2}$$ on FPGAs. - Charles Bouillaguet; Chen-Mou Cheng; Tung Chou; Ruben Niederhagen; Bo-Yin Yang (Selected Areas in Cryptography, 2013)

Provable Second Preimage Resistance Revisited. - Charles Bouillaguet; Bastien Vayssière (Selected Areas in Cryptography, 2013)

Fast Exhaustive Search for Quadratic Systems in 𝔽2 on FPGAs - Extended Version. - Charles Bouillaguet; Chen-Mou Cheng; Tung Chou; Ruben Niederhagen; Bo-Yin Yang (IACR Cryptol. ePrint Arch., 2013)

Cryptographic Schemes Based on the ASASA Structure: Black-Box, White-Box, and Public-Key (Extended Abstract). - Alex Biryukov; Charles Bouillaguet; Dmitry Khovratovich (ASIACRYPT (1), 2014)

Cryptographic Schemes Based on the ASASA Structure: Black-box, White-box, and Public-key. - Alex Biryukov; Charles Bouillaguet; Dmitry Khovratovich (IACR Cryptol. ePrint Arch., 2014)

Sparse Gaussian Elimination Modulo p: An Update. - Charles Bouillaguet; Claire Delaplace (CASC, 2016)

New Second-Preimage Attacks on Hash Functions. - Elena Andreeva 001; Charles Bouillaguet; Orr Dunkelman; Pierre-Alain Fouque; Jonathan J. Hoch; John Kelsey; Adi Shamir; Sébastien Zimmer (J. Cryptol., 2016)

Parallel Sparse PLUQ Factorization modulo p. - Charles Bouillaguet; Claire Delaplace; Marie-Emilie Voge (PASCO@ISSAC, 2017)

Fast Lattice-Based Encryption: Stretching Spring. - Charles Bouillaguet; Claire Delaplace; Pierre-Alain Fouque; Paul Kirchner (PQCrypto, 2017)

Revisiting and Improving Algorithms for the 3XOR Problem. - Charles Bouillaguet; Claire Delaplace; Pierre-Alain Fouque (IACR Trans. Symmetric Cryptol., 2018)

Practical seed-recovery for the PCG Pseudo-Random Number Generator. - Charles Bouillaguet; Florette Martinez; Julia Sauvage (IACR Trans. Symmetric Cryptol., 2020)

A Simple Deterministic Algorithm for Systems of Quadratic Polynomials over 픽2. - Charles Bouillaguet; Claire Delaplace; Monika Trimoska (IACR Cryptol. ePrint Arch., 2021)

Computational records with aging hardware: Controlling half the output of SHA-256. - Mellila Bouam; Charles Bouillaguet; Claire Delaplace; Camille Noûs (Parallel Comput., 2021)

Les attaques cryptographiques sont-elles toujours meilleures que la force brute ? - Charles Bouillaguet (2022)

A Simple Deterministic Algorithm for Systems of Quadratic Polynomials over F2. - Charles Bouillaguet; Claire Delaplace; Monika Trimoska (SOSA, 2022)

Cryptanalysis of Modular Exponentiation Outsourcing Protocols. - Charles Bouillaguet; Florette Martinez; Damien Vergnaud (Comput. J., 2022)

Nice Attacks - but What is the Cost? Computational Models for Cryptanalysis. - Charles Bouillaguet (IACR Cryptol. ePrint Arch., 2022)

Boolean Polynomial Evaluation for the Masses. - Charles Bouillaguet (IACR Cryptol. ePrint Arch., 2022)

We are on the Same Side. Alternative Sieving Strategies for the Number Field Sieve. - Charles Bouillaguet; Ambroise Fleury; Pierre-Alain Fouque; Paul Kirchner (ASIACRYPT (4), 2023)

Cryptanalysis of a Generalized Subset-Sum Pseudorandom Generator. - Charles Bouillaguet; Florette Martinez; Damien Vergnaud (MFCS, 2023)

Preliminary Cryptanalysis of the Biscuit Signature Scheme. - Charles Bouillaguet; Julia Sauvage (IACR Commun. Cryptol., 2024)

Algorithm 1052: Evaluating a Boolean Polynomial on All Possible Inputs. - Charles Bouillaguet (ACM Trans. Math. Softw., 2024)

The May-Ozerov Algorithm for Syndrome Decoding is "Galactic". - Charles Bouillaguet; Claire Delaplace; Mickaël Hamdad (IACR Commun. Cryptol., 2025)

Artificial Results From Hardware Synthesis. - Ahmed Alharbi; Charles Bouillaguet (IACR Cryptol. ePrint Arch., 2025)

Practical cryptanalysis of pseudorandom correlation generators based on quasi-Abelian syndrome decoding. - Charles Bouillaguet; Claire Delaplace; Mickaël Hamdad; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2025)

Blinding Post-Quantum Hash-and-Sign Signatures. - Charles Bouillaguet; Thibauld Feneuil; Jules Maire; Matthieu Rivain; Julia Sauvage; Damien Vergnaud (IACR Cryptol. ePrint Arch., 2025)