Abstract

Code equivalence is one of the hard computational problems studied in post-quantum cryptography. A few recent signature schemes are based on this equivalence problem in the setting of matrix codes. In this talk, I will present the notion of code equivalence, as well as previous algorithms solving the matrix code equivalence problem in specific instances, and then describe a new algorithm called Highway to Hull which tackles the general case. This work, presented at CRYPTO 2025, is joint with Alain Couvreur.

Bio

PhD in arithmetic geometry at Sorbonne Université, currently post-doc at Inria Saclay, interested in applications of algebra and geometry to coding and cryptography.