Decoding supercodes of Gabidulin codes and applications to cryptanalysis

This work addresses cryptanalysis challenges in code-based cryptography, specifically targeting rank-metric encryption schemes, and is incremental as it builds on existing decoding methods.

The paper tackled the problem of decoding supercodes of Gabidulin codes, showing that extending the usual decoder to any supercode reduces the decoding radius significantly, and applied this to achieve polynomial-time attacks on the rank-metric encryption schemes RAMESSES and LIGA.