Weak keys in the McEliece public-key cryptosystem

被引:38
作者
Loidreau, P [1 ]
Sendrier, N [1 ]
机构
[1] Inst Natl Rech Informat & Automat, Project CODES, F-78153 Le Chesnay, France
关键词
automorphism group of a code; Goppa codes; McEliece cryptosystem; support splitting algorithm;
D O I
10.1109/18.915687
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
We show that it is possible to know whether the secret Goppa code of an instance of the McEliece public-key cryptosystem was chosen with a binary generator polynomial, Furthermore, whenever such a weak key is used, we present an attack which can be completed, for codes of length 1024 and dimension 524, with a large, but feasible amount of computation.
引用
收藏
页码:1207 / 1211
页数:5
相关论文
共 16 条