作者: J. K. Gibson
关键词: McEliece cryptosystem 、 Equivalence relation 、 Mathematics 、 Public key cryptosystem 、 Combinatorics 、 Goppa code 、 Discrete mathematics 、 Monic polynomial 、 Finite field
摘要: We show that contrary to a published statement, any instance of McEliece's Public Key Cryptosystem always has many trapdoors. Our proof leads natural equivalence relation on monic polynomials over finite field F such two irreducible Goppa codes whose are equivalent under this as codes.