We show that contrary to a published statement, any instance of McEliece’s Public Key Cryptosystem always has many trapdoors. Our proof leads to a natural equivalence relation on monic polynomials over a finite field F such that any two irreducible Goppa codes over F whose Goppa polynomials are equivalent under this relation are equivalent as codes.