![Algebraic attacks for the rank decoding problem - Lecture 1](/media/cache/video_light/uploads/video/2024-03-05_Bardet_Part1.mp4-e3d247e863dd04a7219c63304b57512c-video-9235208438d042434588a81eb880a9a5.jpg)
![](/assets/front/img/icon-video-play-7e3956a0b9.png)
Algebraic attacks for the rank decoding problem - Lecture 1
De Magali Bardet
![Algebraic attacks for the rank decoding problem - Lecture 2](/media/cache/video_light/uploads/video/2024-03-07_Bardet_Part_2.mp4-b5afe07d54db1e4ebb3c8c0e7bf26ecf-video-846d0e122dfdc7c30279e9de648f2185.jpg)
![](/assets/front/img/icon-video-play-7e3956a0b9.png)
Algebraic attacks for the rank decoding problem - Lecture 2
De Magali Bardet
Apparaît dans la collection : 2023 - Francophone Computer Algebra Days / Journées nationales de calcul formel
Asymmetric cryptographic constructions used today could be attacked given a powerful enough quantum computer. Even if such a computer does not exist yet, it is important to anticipate its possible construction and to prepare a transition to cryptographic tools having a security resistant against attacks from quantum computers. I will introduce lattice-based cryptography, which is the most promising candidate to build post-quantum cryptographic constructions, and in particular, how we build efficient constructions based on structured lattice problems.