The Code Equivalence Problem in Cryptography

Vortrag von Michele Battagliola

Datum: 27.05.26  Zeit: 16.30 - 17.30  Raum: UNINE, B217

Given two linear codes, the Code Equivalence Problem asks to find (if it exists) an isometry between them. In this talk we introduce linear code equivalence and its main variants (permutation, monomial). We then discuss its crucial role as a hardness assumption in post-quantum digital signatures, with particular focus on LESS and related schemes, such as LEAST. Finally, we present new cryptanalysis techniques based on power codes that efficiently solve permutation and linear code equivalence for low dimension codes.