Charles Bouillaguet
Charles Bouillaguet
CRIStAL, university of Lille
Bestätigte E-Mail-Adresse bei univ-lille.fr - Startseite
Titel
Zitiert von
Zitiert von
Jahr
Cryptographic schemes based on the ASASA structure: Black-box, white-box, and public-key
A Biryukov, C Bouillaguet, D Khovratovich
International Conference on the Theory and Application of Cryptology and …, 2014
982014
Second preimage attacks on dithered hash functions
E Andreeva, C Bouillaguet, PA Fouque, JJ Hoch, J Kelsey, A Shamir, ...
Annual International Conference on the Theory and Applications of …, 2008
862008
Automatic search of attacks on round-reduced AES and applications
C Bouillaguet, P Derbez, PA Fouque
Annual Cryptology Conference, 169-187, 2011
792011
Low-data complexity attacks on AES
C Bouillaguet, P Derbez, O Dunkelman, PA Fouque, N Keller, V Rijmen
IEEE transactions on information theory 58 (11), 7002-7017, 2012
642012
Fast Exhaustive Search for Polynomial Systems in
C Bouillaguet, HC Chen, CM Cheng, T Chou, R Niederhagen, A Shamir, ...
International Workshop on Cryptographic Hardware and Embedded Systems, 203-218, 2010
642010
Using first-order theorem provers in the Jahob data structure verification system
C Bouillaguet, V Kuncak, T Wies, K Zee, M Rinard
International Workshop on Verification, Model Checking, and Abstract …, 2007
632007
Herding, second preimage and trojan message attacks beyond Merkle-Damgård
E Andreeva, C Bouillaguet, O Dunkelman, J Kelsey
International Workshop on Selected Areas in Cryptography, 393-414, 2009
352009
Another look at complementation properties
C Bouillaguet, O Dunkelman, G Leurent, PA Fouque
International Workshop on Fast Software Encryption, 347-364, 2010
33*2010
Practical cryptanalysis of the identification scheme based on the isomorphism of polynomial with one secret problem
C Bouillaguet, JC Faugère, PA Fouque, L Perret
International Workshop on Public Key Cryptography, 473-493, 2011
312011
New insights on impossible differential cryptanalysis
C Bouillaguet, O Dunkelman, PA Fouque, G Leurent
International Workshop on Selected Areas in Cryptography, 243-259, 2011
272011
Security Analysis of SIMD
C Bouillaguet, PA Fouque, G Leurent
International Workshop on Selected Areas in Cryptography, 351-368, 2010
232010
New second-preimage attacks on hash functions
E Andreeva, C Bouillaguet, O Dunkelman, PA Fouque, J Hoch, J Kelsey, ...
Journal of Cryptology 29 (4), 657-696, 2016
222016
Graph-theoretic algorithms for the “Isomorphism of Polynomials” problem
C Bouillaguet, PA Fouque, A Véber
Annual International Conference on the Theory and Applications of …, 2013
212013
Attacks on Hash Functions Based on Generalized Feistel: Application to Reduced-Round Lesamnta and SHAvite-3 512
C Bouillaguet, O Dunkelman, G Leurent, PA Fouque
International Workshop on Selected Areas in Cryptography, 18-35, 2010
202010
A family of weak keys in HFE and the corresponding practical key-recovery
C Bouillaguet, PA Fouque, A Joux, J Treger
Journal of Mathematical Cryptology 5 (3-4), 247-275, 2012
172012
Practical key-recovery for all possible parameters of SFLASH
C Bouillaguet, PA Fouque, G Macario-Rat
International Conference on the Theory and Application of Cryptology and …, 2011
162011
Fast Exhaustive Search for Quadratic Systems in on FPGAs
C Bouillaguet, CM Cheng, T Chou, R Niederhagen, BY Yang
International Conference on Selected Areas in Cryptography, 205-222, 2013
122013
Revisiting and improving algorithms for the 3xor problem
C Bouillaguet, C Delaplace, PA Fouque
IACR Transactions on Symmetric Cryptology, 254-276, 2018
112018
Trojan Message Attacks beyond Merkle-Damgård, Selected Areas in Cryptography: 16th Annual International Workshop, SAC 2009, Calgary, Alberta, Canada, August 13-14, 2009 …
E Andreeva, C Bouillaguet, JK Orr Dunkelman, SP Herding
Springer-Verlag, Berlin, Heidelberg, 2009
112009
Analysis of the Collision Resistance of RadioGatúnUsing Algebraic Techniques
C Bouillaguet, PA Fouque
International Workshop on Selected Areas in Cryptography, 245-261, 2008
112008
Das System kann den Vorgang jetzt nicht ausführen. Versuchen Sie es später erneut.
Artikel 1–20