Weak keys in the McEliece public-key cryptosystem
Pierre Loidreau, Nicolas Sendrier · IEEE Transactions on Information Theory · 2001
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.