Weak keys in the McEliece public-key cryptosystem

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 5...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on information theory 2001-03, Vol.47 (3), p.1207-1211
Main Authors: Loidreau, P., Sendrier, N.
Format: Article
Language:English
Subjects:
Algorithms
Computation
Cryptography
Generators
Goppa codes
Information theory
Keys
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:0018-9448
1557-9654
DOI:10.1109/18.915687