00:00:00 / 00:00:00

Algebraic attacks for the rank decoding problem - Lecture 1

By Magali Bardet

Appears in collection : 2024 - French computer algebra days / Journées nationales de calcul formel

Algebraic cryptanalysis has become unavoidable in the cryptanalysis and design of schemes in cryptography. In the first part, I explain what is a good algebraic modeling, and how we can estimate the complexity of solving a polynomial system with Gröbner basis. In the second part, I present different algebraic modelings for the decoding problem in rank metric code-based cryptography, and their complexity analysis.

Information about the video

Citation data

  • DOI 10.24350/CIRM.V.20148503
  • Cite this video Bardet, Magali (05/03/2024). Algebraic attacks for the rank decoding problem - Lecture 1. CIRM. Audiovisual resource. DOI: 10.24350/CIRM.V.20148503
  • URL https://dx.doi.org/10.24350/CIRM.V.20148503

Last related questions on MathOverflow

You have to connect your Carmin.tv account with mathoverflow to add question

Ask a question on MathOverflow


  • Bookmark videos
  • Add videos to see later &
    keep your browsing history
  • Comment with the scientific
  • Get notification updates
    for your favorite subjects
Give feedback