Structural Attacks for Public Key Cryptosystems based on Gabidulin Codes

被引：0

作者：

R. Overbeck

机构：

[1] Cryptography and Computer Algebra Group,Technishe Universität Darmstadt, Department of Computer Science

来源：

Journal of Cryptology | 2008年 / 21卷

关键词：

Public key cryptography; Code based cryptography; Rank distance codes; Gabidulin codes;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

In this paper we look at the Gabidulin version of the McEliece cryptosystem (GPT) and its variants. We give an overview over the existing structural attacks on the basic scheme, and show how to combine them to get an effective attack for every GPT variant. As a consequence, there are no secure parameter sets left for GPT variants, which one would like to use in practice.

引用

页码：280 / 301

页数：21

共 12 条

[1]

Berger T.P.(2005)How to mask the structure of codes for a cryptographic use Des. Codes Cryptogr. 35 63-79

[2]

Loidreau P.(2003)Column scrambler for the GPT cryptosystem Discrete Appl. Math. 128 207-221

[3]

Gabidulin E.M.(2003)Reducible rank codes and their applications to cryptography IEEE Trans. Inform. Theory 49 3289-3293

[4]

Ourivski A.V.(1995)Severely denting the Gabidulin version of the McEliece public key cryptosystem Des. Codes Cryptogr. 6 37-45

[5]

Gabidulin E.M.(2002)New technique for decoding codes in the rank metric and its cryptography applications Problems Inform. Transm. 38 237-246

[6]

Ourivski A.V.(1978)A public key cryptosystem based on algebraic coding theory DSN Prog. Rep. 42–44 114-116

[7]

Honary B.(undefined)undefined undefined undefined undefined-undefined

[8]

Ammar B.(undefined)undefined undefined undefined undefined-undefined

[9]

Gibson J.K.(undefined)undefined undefined undefined undefined-undefined

[10]

Johansson T.(undefined)undefined undefined undefined undefined-undefined

← 1 2 →