Maxime BOMBAR

PhD Candidate

Address: Laboratoire d'Informatique (LIX)
École Polytechnique.
91128 PALAISEAU CEDEX
Office 2048
Mail : maxime [dot] bombar [at] inria.fr
https://orcid.org/0000-0001-9081-6094
https://github.com/mbombar
Here is my gpg public key

Starting from September 2020, I'm a PhD candidate in the project-team Grace, working under the supervision of Alain Couvreur and Thomas Debris-Alazard.

Preprints

Publications

International Conferences

• On Codes and Learning With Errors over Function Fields
  Maxime Bombar, Alain Couvreur, Thomas Debris-Alazard
  To appear, CRYPTO 2022.


• Right-hand side decoding of Gabidulin codes and applications
  Maxime Bombar, Alain Couvreur.
  International Workshop on Coding and Cryptography 2022 - WCC2022.


• Decoding Supercodes of Gabidulin Codes and Applications to Cryptanalysis
  Maxime Bombar, Alain Couvreur.
  Best Paper Award.
  International conference on post quantum cryptography - PQCrypto2021. Lecture Notes in Computer Science, vol 12841, pp 3-22.
  • The Sage code of the attack is available on Github:

Talks

Research seminars

• On Codes and Learning With Errors over Function Fields. [Slides]
  IAA-IMATH Seminar, Toulon, France (Online), February 22, 2022


• Decoding Supercodes of Gabidulin codes and Applications to Cryptanalysis. [Slides]
  Codes and Cryptography research group, INRIA Paris (Online), April 14, 2021.


• Decoding Supercodes of Gabidulin Codes and Applications to Cryptanalysis. [Slides]
  Crypto Seminar, CWI Amsterdam (Online), April 9, 2021.


• Finding Waldo in Euclidean Lattices: An introduction to Search-To-Decision reductions. [Slides]
  Grace Young Research Seminar (GT Oisillons, Online), March 5, 2021.


• Rank metric codes, or How to skew Polynomials. [No slides]
  Grace Young Research Seminar (GT Oisillons, Online), January 8, 2021.


• Cryptanalysis of the Faure-Loidreau PKE, a rank-metric code-based cryptosystem with short keys. [Slides]
  Team Grace Seminar, INRIA Saclay & LIX (Online), November 3, 2020.