Charles Bouillaguet
32
Documents
Publications
|
Plateformes de TP interactives pour l'enseignement de la cryptographieRendez-vous de la recherche et de l’enseignement de la sécurité des systèmes d’information (RESSI 2023), gdr securité, May 2023, Neuvy-sur-Barangeon, France
Conference papers
hal-04038343v1
|
|
We are on the same side. Alternative sieving strategies for the number field sieveASIACRYPT 2023 - 29th International Conference on the Theory and Application of Cryptology and Information Security, Dec 2023, Guangzhou, China. pp.138-166, ⟨10.1007/978-981-99-8730-6_5⟩
Conference papers
hal-04112671v1
|
Cryptanalysis of a Generalized Subset-Sum Pseudorandom Generator48th International Symposium on Mathematical Foundations of Computer Science (MFCS 2023), Aug 2023, Bordeaux, France
Conference papers
hal-04170404v1
|
|
|
A Simple Deterministic Algorithm for Systems of Quadratic Polynomials over F 2Symposium on Simplicity in Algorithms (SOSA), SIAM, Jan 2022, Alexandria, United States. pp.285-296, ⟨10.1137/1.9781611977066.22⟩
Conference papers
hal-03363031v1
|
|
Fast Lattice-Based Encryption: Stretching SpringInternational Workshop on Post-Quantum Cryptography, Jun 2017, Utrecht, Netherlands
Conference papers
hal-01654408v1
|
|
Parallel Sparse PLUQ Factorization modulo pPASCO'17, Jul 2017, Kaiserslautern, Germany. pp.1 - 10, ⟨10.1145/3115936.3115944⟩
Conference papers
hal-01646133v1
|
|
Sparse Gaussian Elimination modulo p: an UpdateComputer Algebra in Scientific Computing, Sep 2016, Bucharest, Romania
Conference papers
hal-01333670v1
|
|
Graph-Theoretic Algorithms for the “Isomorphism of Polynomials” ProblemAdvances in Cryptology - {EUROCRYPT} 2013, May 2013, Athenes, Greece. pp.17, ⟨10.1007/978-3-642-38348-9_13⟩
Conference papers
hal-00825503v2
|
|
Practical Cryptanalysis of the Identification Scheme Based on the Isomorphism of Polynomial With One Secret Problem14th IACR International Conference on Practice and Theory of Public Key Cryptography - PKC 2011, Mar 2011, Taormina, Italy. pp.473-493, ⟨10.1007/978-3-642-19379-8_29⟩
Conference papers
inria-00556671v1
|
Automatic Search of Attacks on Round-Reduced AES and ApplicationsCRYPTO 2011 - 31st Annual Cryptology Conference, Aug 2011, Santa Barbara, CA, United States. pp.169-187, ⟨10.1007/978-3-642-22792-9_10⟩
Conference papers
hal-01110414v1
|
|
|
Attacks on Hash Functions based on Generalized Feistel -- Application to Reduced-Round Lesamnta and Shavite-3-512Selected Areas in Cryptography, 10th Annual International Workshop, SAC 2010, 2010, Ontario, Canada
Conference papers
inria-00556679v1
|
|
Security Analysis of SIMDSelected Areas in Cryptography, 10th Annual International Workshop, SAC 2010, 2010, Ontario, Canada
Conference papers
inria-00556680v1
|
|
Another Look at Complementation PropertiesFast Software Encryption, 17th International Workshop : FSE 2010, 2010, Seoul, South Korea. pp.347-364, ⟨10.1007/978-3-642-13858-4_20⟩
Conference papers
inria-00556674v1
|
|
Herding, Second Preimage and Trojan Message Attacks Beyond Merkle-DamgaardSAC, Aug 2009, Calgary, Canada. 22p
Conference papers
inria-00417798v1
|
|
Second Preimage Attacks on Dithered Hash FunctionsEurocrypt, Apr 2008, Istanbul, Turkey. pp.270-288, ⟨10.1007/978-3-540-78967-3_16⟩
Conference papers
inria-00417796v1
|
|
Analysis of the Collision Resistance of RadioGatun using Algebraic TechniquesSelected Areas in Cryptography, 15th International Workshop, SAC 2008, Aug 2008, Sackville, Canada. pp.245-261, ⟨10.1007/978-3-642-04159-4_16⟩
Conference papers
inria-00417797v1
|
Le Code de CambridgeEditions du Pommier, collection "Romans et plus", pp.512, 2010, Le Code de Cambridge, 978-2-7465-0465-3
Books
hal-02089144v1
|
|
Artificial Results From Hardware Synthesis2025
Preprints, Working Papers, ...
hal-04896063v1
|
|
Nice Attacks — but What is the Cost? Computational Models for Cryptanalysis2022
Preprints, Working Papers, ...
hal-02306912v2
|
|
Algorithms for Sparse Random 3XOR: The Low-Density Case2021
Preprints, Working Papers, ...
hal-02306917v4
|
|
Algorithms for some hard problems and cryptographic attacks against specific cryptographic primitivesCryptography and Security [cs.CR]. Université Paris Diderot (Paris 7), 2011. English. ⟨NNT : ⟩
Theses
tel-03630843v1
|
|
Les attaques cryptographiques sont-elles toujours meilleures que la force brute ?Cryptographie et sécurité [cs.CR]. Sorbonne Université, 2022
Accreditation to supervise research
tel-03616505v1
|