Weak keys in the McEliece public-key cryptosystem

P. Loidreau, N. Sendrier
2001 IEEE Transactions on Information Theory  
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.
doi:10.1109/18.915687 fatcat:winbq5r2hrhhzktv2b273w66zi