CRITNov 4, 2015

Extension of Overbeck's Attack for Gabidulin Based Cryptosystems

arXiv:1511.01549v248 citations
Originality Incremental advance
AI Analysis

This work addresses a security vulnerability in rank metric-based cryptosystems, specifically for cryptographic applications, and is incremental as it extends an existing attack method.

The authors tackled the problem of breaking two variants of the GPT cryptosystem designed to resist Overbeck's attack, and they developed a new attack that successfully cryptanalyzes these systems.

We present a new attack against cryptosystems based on the rank metric. Our attack allows us to cryptanalyze two variants of the GPT cryptosystem which were designed to resist the attack of Overbeck.

Foundations

The foundational work for this paper's niche, ranked by how specifically the neighbourhood builds on it — not by global fame.

Your Notes