An Algebraic Attack on Rank Metric Code-Based Cryptosystems

Explore an algebraic attack on rank metric code-based cryptosystems in this 25-minute conference talk presented at Eurocrypt 2020. Delve into the McEliece cryptosystem and code-based cryptography before examining the researchers' contributions. Investigate the rank decoding search problem and specific code families. Learn about syndrome modelling and the full rank matrix heuristic. Review experimental results and theoretical security implications for various cryptosystems. Gain insights into this cutting-edge research in cryptography and its potential impact on future security systems.

Intro
McEliece cryptosystem
Code-Based cryptography
Our contributions
Rank Decoding search Problem
Specific family of codes
Syndrome modelling
Heuristic: full rank matrix
Experimental results in the paper
Theoretical security for several cryptosystems
Conclusion