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.
No takes yet. Share an insight, caveat, or question.
Loidreau et al. (2001) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: