Structural attacks for public key cryptosystems based on Gabidulin codes (Q2425529)

From MaRDI portal
Revision as of 02:46, 13 November 2024 by Daniel (talk | contribs) (‎Created claim: DBLP publication ID (P1635): journals/joc/Overbeck08, #quickstatements; #temporary_batch_1731461124002)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Structural attacks for public key cryptosystems based on Gabidulin codes
scientific article

    Statements

    Structural attacks for public key cryptosystems based on Gabidulin codes (English)
    0 references
    0 references
    6 May 2008
    0 references
    The author presents a new attack on the Gabidulin-Paramonov-Tretjakov variant of the McEliece cryptosystem. This variant uses codes in the rank metric which was introduced by Gabidulin. Section 1 is introductory. In Section 2, the author introduces the rank metric for linear codes. In Section 3, he describes the Gabidulin-Paramonov-Tretjakov (GPT) variant of the McEliece cryptosystem. Section 4 surveys the so-called structural attacks on such cryptosystems. In sections 5 and 6, the author develops a new powerful attack and argues that it is not possible to avoid this attack by using subfield codes of the Gabidulin codes. He concludes that none of the existing GPT variants is secure for parameters that are of practical interest.
    0 references
    public key cryptography
    0 references
    linear codes
    0 references
    rank distance
    0 references
    Gabidulin codes
    0 references
    Gabidulin-Paramonov-Tretjakov variant of the McEliece cryptosystem
    0 references

    Identifiers