Publications

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 version] [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 version] [doi]
• M. Bardet, I. Boussaada, ``Complexity reduction of C-algorithm'', Applied Mathematics and Computation, vol. 217, Issue 17, pp. 7318-7323, May 2011. [ArXiv version] [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 version] [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 version] [doi]
Conference Papers:
• 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. [LNCS] [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. [LNCS] [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. [LNCS] [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. [pdf] [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] [doi]
[abstract ps] [Slides] [INRIA Research Report, November 2002]
Preprints:
• 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]
Cours/exposés invités:
• "Secret et faisabilité technique", Colloque de droit, Les NTIC face aux droits et libertés fondamentaux à travers le prisme du SECRET, Rouen, 15 avril 2015. [Programme]
• "Introduction aux bases de Gröbner, complexité et application à la cryptographie", École de printemps, Journées Codage et Cryptographie 2014, Grenoble. [Slides]

Last update : June, 2012.