Étude des systèmes algébriques surdéterminés. Applications aux codes correcteurs et à la cryptographie. - Magali Bardet (2004)

On formulas for decoding binary cyclic codes. - Daniel Augot; Magali Bardet; Jean-Charles Faugère (ISIT, 2007)

On the decoding of binary cyclic codes with the Newton identities. - Daniel Augot; Magali Bardet; Jean-Charles Faugère (J. Symb. Comput., 2009)

Complexity reduction of C-Algorithm. - Magali Bardet; Islam Boussaada (Appl. Math. Comput., 2011)

On the degree of the polynomial defining a planar algebraic curves of constant width. - Magali Bardet; Térence Bayen (CoRR, 2013)

On the complexity of solving quadratic Boolean systems. - Magali Bardet; Jean-Charles Faugère; Bruno Salvy; Pierre-Jean Spaenlehauer (J. Complex., 2013)

On the complexity of the F5 Gröbner basis algorithm. - Magali Bardet; Jean-Charles Faugère; Bruno Salvy (J. Symb. Comput., 2015)

Weak Keys for the Quasi-Cyclic MDPC Public Key Encryption Scheme. - Magali Bardet; Vlad Dragoi; Jean-Gabriel Luque; Ayoub Otmani (AFRICACRYPT, 2016)

Algebraic properties of polar codes from a new polynomial formalism. - Magali Bardet; Vlad Dragoi; Ayoub Otmani; Jean-Pierre Tillich (ISIT, 2016)

Cryptanalysis of the McEliece Public Key Cryptosystem Based on Polar Codes. - Magali Bardet; Julia Chaulet; Vlad Dragoi; Ayoub Otmani; Jean-Pierre Tillich (PQCrypto, 2016)

Practical Algebraic Attack on DAGS. - Magali Bardet; Manon Bertin; Alain Couvreur; Ayoub Otmani (CBC, 2019)

Permutation Code Equivalence is Not Harder Than Graph Isomorphism When Hulls Are Trivial. - Magali Bardet; Ayoub Otmani; Mohamed Saeed-Taha (ISIT, 2019)

Improvements of Algebraic Attacks for Solving the Rank Decoding and MinRank Problems. - Magali Bardet; Maxime Bros; Daniel Cabarcas; Philippe Gaborit; Ray A. Perlner; Daniel Smith-Tone; Jean-Pierre Tillich; Javier A. Verbel (ASIACRYPT (1), 2020)

An Algebraic Attack on Rank Metric Code-Based Cryptosystems. - Magali Bardet; Pierre Briaud; Maxime Bros; Philippe Gaborit; Vincent Neiger; Olivier Ruatta; Jean-Pierre Tillich (EUROCRYPT (3), 2020)

Algebraic attacks for solving the Rank Decoding and MinRank problems without Gröbner basis. - Magali Bardet; Maxime Bros; Daniel Cabarcas; Philippe Gaborit; Ray A. Perlner; Daniel Smith-Tone; Jean-Pierre Tillich; Javier A. Verbel (CoRR, 2020)

Decoding Reed-Solomon codes by solving a bilinear system with a Gröbner basis approach. - Magali Bardet; Rocco Mora; Jean-Pierre Tillich (ISIT, 2021)

An Algebraic Approach to the Rank Support Learning Problem. - Magali Bardet; Pierre Briaud (PQCrypto, 2021)

Improvement of Algebraic Attacks for Solving Superdetermined MinRank Instances. - Magali Bardet; Manon Bertin (PQCrypto, 2022)

Polynomial time attack on high rate random alternant codes. - Magali Bardet; Rocco Mora; Jean-Pierre Tillich (CoRR, 2023)

Revisiting algebraic attacks on MinRank and on the rank decoding problem. - Magali Bardet; Pierre Briaud; Maxime Bros; Philippe Gaborit; Jean-Pierre Tillich (Des. Codes Cryptogr., 2023)

Polynomial Time Key-Recovery Attack on High Rate Random Alternant Codes. - Magali Bardet; Rocco Mora; Jean-Pierre Tillich (IEEE Trans. Inf. Theory, 2024)

Computation of the Hilbert Series for the Support-Minors Modeling of the MinRank Problem. - Magali Bardet; Alban Gilard (CoRR, 2025)

The Matrix Subcode Equivalence problem and its application to signature with MPC-in-the-Head. - Magali Bardet; Charles Brion; Philippe Gaborit; Mercedes Haiech; Romaric Neveu (CoRR, 2025)