Alain Couvreur

1. Distinguisher-Based Attacks on Public-Key Cryptosystems Using\n Reed-Solomon Codes
   2013/07/24 by Alain Couvreur, Philippe Gaborit, Couvreur, Alain +6 · 5 citations
   Computer Science · Engineering · #Coding theory and cryptography #graph theory and CDMA systems #Quantum Computing Algorithms and Architecture
2. Distinguisher-based attacks on public-key cryptosystems using Reed–Solomon codes
   2014/04/19 by Alain Couvreur, Philippe Gaborit, Valérie Gauthier-Umaña +4 · 4 citations
   Computer Science · Engineering · Mathematics · #Coding theory and cryptography #Finite Group Theory Research #graph theory and CDMA systems
3. A Polynomial-Time Attack on the BBCRS Scheme
   2015/01/15 by Alain Couvreur, Couvreur, Alain, Ayoub Otmani +5 · 2 citations
   Computer Science · Engineering · #Coding theory and cryptography #Cryptographic Implementations and Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #Information Theory (cs.IT) #graph theory and CDMA systems
4. Toward good families of codes from towers of surfaces
   2020/02/06 by Alain Couvreur, Philippe Lebacque, Couvreur, Alain +3 · 2 citations
   Computer Science · Mathematics · #Algebraic Geometry (math.AG) #Coding theory and cryptography #FOS: Computer and information sciences #FOS: Mathematics #Finite Group Theory Research #Information Theory (cs.IT) #Mathematical Approximation and Integration #Number Theory (math.NT)
5. Rank-metric codes over arbitrary Galois extensions and rank analogues of\n Reed-Muller codes
   2020/06/25 by Daniel Augot, Augot, Daniel, Alain Couvreur +5 · 2 citations
   Computer Science · #Coding theory and cryptography #Cooperative Communication and Network Coding #Error Correcting Code Techniques #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Number Theory (math.NT) #Rings and Algebras (math.RA)
6. Polynomial Time Attack on Wild McEliece Over Quadratic Extensions
   2014/02/13 by Alain Couvreur, Couvreur, Alain, Ayoub Otmani +3 · 1 citation
   Computer Science · #Cellular Automata and Applications #Coding theory and cryptography #Cryptographic Implementations and Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #FOS: Mathematics #Information Theory (cs.IT) #Number Theory (math.NT)
7. An upper bound on the number of rational points of arbitrary projective varieties over finite fields
   2014/09/26 by Alain Couvreur, Couvreur, Alain · 1 citation
   Computer Science · Mathematics · #11C25 #14J20 #Algebraic Geometry (math.AG) #Algebraic Geometry and Number Theory #Coding theory and cryptography #Combinatorics (math.CO) #FOS: Mathematics #Number Theory (math.NT) #Tensor decomposition and applications
8. A new approach based on quadratic forms to attack the McEliece cryptosystem
   2023/06/17 by Alain Couvreur, Couvreur, Alain, Rocco Mora +3 · 2 citations
   Computer Science · Engineering · #68 #Coding theory and cryptography #Cryptographic Implementations and Security #Cryptography and Security (cs.CR) #E.3 #E.4 #FOS: Computer and information sciences #graph theory and CDMA systems