Pierre Loidreau
INRIA, projet CODES
BP 105
78153 Le Chesnay Cedex, France Pierre.Loidreau@inria.fr
Nicolas Sendrier
INRIA, projet CODES
BP 105
78153 Le Chesnay Cedex, France Nicolas.Sendrier@inria.fr
IEEE Transactions on Information Theory, 47(3):1207-1212, March
2001.
Abstract
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.
Keywords
Automorphism group of a code, Goppa codes, McEliece
cryptosystem, support splitting algorithm.