Magali Bardet

According to our database, Magali Bardet authored at least 20 papers between 2004 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

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., November, 2023

Polynomial time attack on high rate random alternant codes.

Magali Bardet, Rocco Mora, Jean-Pierre Tillich

CoRR, 2023

2022

Improvement of Algebraic Attacks for Solving Superdetermined MinRank Instances.

Magali Bardet, Manon Bertin

Proceedings of the Post-Quantum Cryptography - 13th International Workshop, 2022

2021

An Algebraic Approach to the Rank Support Learning Problem.

Magali Bardet, Pierre Briaud

Proceedings of the Post-Quantum Cryptography - 12th International Workshop, 2021

Decoding Reed-Solomon codes by solving a bilinear system with a Gröbner basis approach.

Magali Bardet, Rocco Mora, Jean-Pierre Tillich

Proceedings of the IEEE International Symposium on Information Theory, 2021

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

An Algebraic Attack on Rank Metric Code-Based Cryptosystems.

Magali Bardet, Pierre Briaud, Maxime Bros, Philippe Gaborit, Vincent Neiger, Olivier Ruatta, Jean-Pierre Tillich

Proceedings of the Advances in Cryptology - EUROCRYPT 2020, 2020

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

Proceedings of the Advances in Cryptology - ASIACRYPT 2020, 2020

2019

Permutation Code Equivalence is Not Harder Than Graph Isomorphism When Hulls Are Trivial.

Magali Bardet, Ayoub Otmani, Mohamed Saeed-Taha

Proceedings of the IEEE International Symposium on Information Theory, 2019

Practical Algebraic Attack on DAGS.

Magali Bardet, Manon Bertin, Alain Couvreur, Ayoub Otmani

Proceedings of the Code-Based Cryptography - 7th International Workshop, 2019

2016

Cryptanalysis of the McEliece Public Key Cryptosystem Based on Polar Codes.

Magali Bardet, Julia Chaulet, Vlad Dragoi, Ayoub Otmani, Jean-Pierre Tillich

Proceedings of the Post-Quantum Cryptography - 7th International Workshop, 2016

Algebraic properties of polar codes from a new polynomial formalism.

Magali Bardet, Vlad Dragoi, Ayoub Otmani, Jean-Pierre Tillich

Proceedings of the IEEE International Symposium on Information Theory, 2016

Weak Keys for the Quasi-Cyclic MDPC Public Key Encryption Scheme.

Magali Bardet, Vlad Dragoi, Jean-Gabriel Luque, Ayoub Otmani

Proceedings of the Progress in Cryptology - AFRICACRYPT 2016, 2016

2015

On the complexity of the F5 Gröbner basis algorithm.

Magali Bardet, Jean-Charles Faugère, Bruno Salvy

J. Symb. Comput., 2015

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 degree of the polynomial defining a planar algebraic curves of constant width.

Magali Bardet, Térence Bayen

CoRR, 2013

2011

Complexity reduction of C-Algorithm.

Magali Bardet, Islam Boussaada

Appl. Math. Comput., 2011

2009

On the decoding of binary cyclic codes with the Newton identities.

Daniel Augot, Magali Bardet, Jean-Charles Faugère

J. Symb. Comput., 2009

2007

On formulas for decoding binary cyclic codes.

Daniel Augot, Magali Bardet, Jean-Charles Faugère

Proceedings of the IEEE International Symposium on Information Theory, 2007

2004

Étude des systèmes algébriques surdéterminés. Applications aux codes correcteurs et à la cryptographie.

Magali Bardet

PhD thesis, 2004