| PdD Thesis: | |||
|---|---|---|---|
| • M. Bardet, ``Étude des systèmes algébriques surdéterminés. Applications aux codes correcteurs et à la cryptographie'', PhD thesis, Université Paris VI, Décembre 2004. | [pdf] | [TEL] | |
| [Résumé] [Jury] Les transparents de ma soutenance [pdf] | |||
| Journal Papers: | |||
| • Magali Bardet, Jean-Charles Faugère, Bruno Salvy, ``On the complexity of the F5 Gröbner basis Algorithm'', Journal of Symbolic Computation, Volume 70, 2015, Pages 49-70, | [ArXiv] | [doi] | |
| • Magali Bardet, Jean-Charles Faugère, Bruno Salvy, and Pierre-Jean Spaenlehauer, ``On the complexity of solving quadratic boolean systems'', Journal of Complexity, Volume 29, Issue 1, February 2013, Pages 53-75, ISSN 0885-064X. | [ArXiv] | [doi] | |
| • M. Bardet, I. Boussaada, ``Complexity reduction of C-algorithm'', Applied Mathematics and Computation, vol. 217, Issue 17, pp. 7318-7323, May 2011. | [ArXiv] | [doi] | |
| • M. Bardet, I. Boussaada, A. R. Chouikha, J.-M. Strelcyn, ``Isochronicity conditions for some planar polynomial systems II'', Bulletin des Sciences Mathématiques, vol. 135, issue 2, pp. 230-249, March 2011. | [ArXiv] | [doi] | |
| • Daniel Augot, Magali Bardet, Jean-Charles Faugère, On the decoding of binary cyclic codes with the newton identities, Journal of Symbolic Computation, Volume 44, Issue 12, December 2009, Pages 1608--1625, ISSN 0747-7171. | [ArXiv] | [doi] | Conference Papers: |
| • M. Bardet and M. Bertin, ``Improvement of algebraic attacks for solving superdetermined MinRank instances'', In: Cheon J.H., Johansson T. (eds) Post-Quantum Cryptography. PQCrypto 2022. Lecture Notes in Computer Science, vol 13512. Springer, Cham, 2022. | [ArXiv] | [doi] | |
| • M. Bardet and P. Briaud, ``An algebraic approach to the Rank Support Learning problem'', In: Cheon J.H., Tillich JP. (eds) Post-Quantum Cryptography. PQCrypto 2021. Lecture Notes in Computer Science, vol 12841. Springer, Cham, 2021. | [ArXiv] | [doi] | |
| • M. Bardet, R. Mora and J.-P. Tillich: Decoding Reed-Solomon codes by solving a bilinear system with a Gröbner basis approach . ISIT 2021 (IEEE International Symposium on Information Theory, July 12-20, Melbourne, Victoria, Australia), 2021. | [ArXiv] | [doi] | |
| • M. Bardet, M. Bros, D. Cabarcas, P. Gaborit, R. Perlner, D. Smith-Tone, J.-P. Tillich, and J. Verbel: Improvements of Algebraic Attacks for Solving the Rank Decoding and MinRank Problems . In: Moriai S., Wang H. (eds) Advances in Cryptology - ASIACRYPT 2020. Lecture Notes in Computer Science, vol 12491. Springer, Cham. 2020. | [ArXiv] | [doi] | |
| • M. Bardet, P. Briaud, M. Bros, P. Gaborit, V. Neiger, O. Ruatta, J.-P. Tillich: An Algebraic Attack on Rank Metric Code-Based Cryptosystems. In: Canteaut A., Ishai Y. (eds) Advances in Cryptology - EUROCRYPT 2020. Lecture Notes in Computer Science, vol 12107. Springer, Cham. 2020. | [ArXiv] | [doi] | |
| • M. Bardet, A. Otmani, and M. A. M. Saeed Taha, ``Permutation Code Equivalence is Not Harder Than Graph Isomorphism When Hulls Are Trivial, In ISIT 2019 (IEEE International Symposium on Information Theory, July 12-16, Paris, France), 2019. | [ArXiv] | [doi] | |
| • M. Bardet, M. Bertin, A. Couvreur, and A. Otmani, ``Practical Algebraic Attack on DAGS'', In: Baldi M., Persichetti E., Santini P. (eds) Code-Based Cryptography. CBC 2019. Lecture Notes in Computer Science, vol 11666. Springer, Cham, 2019. | [ArXiv] | [doi] | |
| • M. Bardet, V. Dragoi, A. Otmani, and J.-P. Tillich, ``Algebraic Properties of Polar Codes From a New Polynomial Formalism, In ISIT 2016 (IEEE International Symposium on Information Theory, July 10-15, Barcelona, Spain), 2016. | [ArXiv] | [doi] | |
| • M. Bardet, V. Dragoi, J.-G. Luque, A. Otmani, ``Weak Keys for the Quasi-Cyclic MDPC Public Key Encryption Scheme'', In Pointcheval, David, Nitaj, Abderrahmane, Rachidi, Tajjeeddine editors, Progress in Cryptology - AFRICACRYPT 2016, (8th International Conference on Cryptology in Africa, Fes, Morocco), 2016. | [HAL] | [doi] | |
| • M. Bardet, J. Chaulet, V. Dragoi, A. Otmani, and J.-P. Tillich, ``Cryptanalysis of the McEliece Public Key Cryptosystem Based on Polar Codes'', In Takagi, Tsuyoshi editors, PQCrypto 2016, (Post-Quantum Cryptography, 7th International Workshop, Fukuoka, Japan), 2016. | [HAL] | [doi] | |
| • D. Augot, M. Bardet, and J.-C. Faugère, ``On formulas for decoding binary cyclic codes'', In Shokrollahi Goldsmith, Medard and Zamir, editors, ISIT 2007 (IEEE International Symposium on Information Theory, Nice), pages 2646--2650, 2007. | [ArXiv] | [doi] | |
| • M. Bardet, J-C. Faugère, B. Salvy and B-Y. Yang, ``Asymptotic Behaviour of the Degree of Regularity of Semi-Regular Polynomial Systems'', in MEGA 2005, Eighth International Symposium on Effective Methods in Algebraic Geometry, Porto Conte, Alghero, Sardinia (Italy), May 27th - June 1st, 15 p., 2005. | [pdf] | ||
| • M. Bardet, J-C. Faugère and B. Salvy, "On the complexity of Gröbner basis computation of semi-regular overdetermined algebraic equations", in Proc. ICPSS'04 (International Conference on Polynomial System Solving), Paris, France), pp. 71-75, 2004. | [pdf] | ||
| • D. Augot, M. Bardet, and J-C. Faugère, "Efficient decoding of (binary) cyclic codes above the correction capacity of the code using Gröbner bases", in Proc. IEEE International Symposium on Information Theory 2003 (ISIT, June 29 - July 4, Yokohama, Japan), page 362, 2003. | [Full Version, HAL] | [doi] | |
| [abstract ps] [Slides] [INRIA Research Report, November 2002] | Standardisation: | ||
| • N. Aragon, O. Blazy, J.-C. Deneuville, P. Gaborit, A. Hauteville, O. Ruatta, J.-P. Tillich, G. Zemor, C. Aguilar Melchor, S. Bettaieb, L. Bidoux, M. Bardet, and A. Otmani, ROLLO. NIST Round 2 submission for Post-Quantum Cryptography, 2019. | [Site] | [NIST] | |
| • A. Couvreur, M. Bardet, É. Barelli, O. Blazi, R. Cando Torres, P. Gaborit, A. Otmani, N. Sendrier, J.-P. Tillich, BIG-QUAKE. NIST Round 1 submission for Post-Quantum Cryptography, 2017. | [Site] | [NIST] | Conférences invitées: |
| • M. Bardet, "Secret et faisabilité technique", Rouen, 15 avril 2015. Publié dans le livre « NTIC, secret et droits fondamentaux - Les NTIC face aux droits et libertés fondamentaux à travers le prisme du SECRET » sous la direction scientifique de Catherine Blaisot-Hazard, Institut Universitaire Varenne, collection Colloques et Essais, Volume 36, Pages 37-42, 2017. ISBN : 978-2-37032-111-4. | [Le livre] | Cours/Exposés invités: | |
| • "Cryptographie post-quantique: processus de standardisation du NIST et derniers développements, en particulier en cryptographie basée sur les codes", Journée du Conseil scientifique de l'AFNIC, 03/07/2019, #JCSA19, Paris. | [Slides] | ||
| • "Problématiques en cryptanalyse algébrique", Journées Codage et Cryptographie 2018, Aussois. | |||
| • "Introduction aux bases de Gröbner, complexité et application à la cryptographie", École de printemps, Journées Codage et Cryptographie 2014, Grenoble. | [Slides] | Preprints: | |
| • M. Bardet, P. Briaud, M. Bros, P. Gaborit, J.-P. Tillich, `` Revisiting Algebraic Attacks on MinRank and on the Rank Decoding Problem''. | [ArXiv, 2022] | [eprint, 2022] | |
| • M. Bardet, J-C. Faugère, B. Salvy, ``On the complexity of Gröbner basis computation for regular and semi-regular systems''. | [INRIA Research Report 5049, 2003] |