Decoding supercodes of Gabidulin codes and applications to cryptanalysis

Overbeck攻击的扩展及其在基于Twisted Gabidulin方案的密码分析中的应用

An extension of Overbeck's attack with an application to cryptanalysis of Twisted Gabidulin-based schemes

本文从密码学角度研究Gabidulin及相关码的译码，发现其仅凭生成矩阵即可译码，据此扩展了Gibson和Overbeck攻击，并将其成功应用于破解基于twisted Gabidulin码的广义GPT加密方案。

Improved Cryptanalysis of Rank Metric Schemes Based on Gabidulin Codes

We prove that any variant of the GPT cryptosystem which uses a right column scrambler over the extension field as advocated by the works of Gabidulin et al. with the goal to resist to Overbeck's structural attack are actually still vulnerable to that attack. We show that by applying the Frobenius operator appropriately on the public key, it is possible to build a Gabidulin code having the same dimension as the original secret Gabidulin code but with a lower length. In particular, the code obtained by this way correct less errors than the secret one but its error correction capabilities are bey…

Cryptanalysis of a System Based on Twisted Reed-Solomon Codes

Twisted Reed-Solomon (TRS) codes are a family of codes that contains a large number of maximum distance separable codes that are non-equivalent to Reed--Solomon codes. TRS codes were recently proposed as an alternative to Goppa codes for the McEliece code-based cryptosystem, resulting in a potential reduction of key sizes. The use of TRS codes in the McEliece cryptosystem has been motivated by the fact that a large subfamily of TRS codes is resilient to a direct use of known algebraic key-recovery methods. In this paper, an efficient key-recovery attack on the TRS variant that was used in the …

破解基于矩阵码的ACDGV MinRank Gabidulin加密方案

Breaking ACDGV MinRank Gabidulin encryption schemes over matrix codes

本文提出一种结合组合与代数技术的攻击，破解了Asiacrypt 2024提出的全部16个EGMC加密参数集，可在多项式时间内恢复等效密钥，大幅降低其安全级别。