Proceedings of CRYPTO 84 on Advances in cryptology
An observation on the security of McEliece's public-key cryptosystem
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Security-Related Comments Regarding McEliece's Public-Key Cryptosystem
CRYPTO '87 A Conference on the Theory and Applications of Cryptographic Techniques on Advances in Cryptology
On the McEliece Public-Key Cryptosystem
CRYPTO '88 Proceedings of the 8th Annual International Cryptology Conference on Advances in Cryptology
Strengthening McEliece Cryptosystem
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Semantically Secure McEliece Public-Key Cryptosystems-Conversions for McEliece PKC
PKC '01 Proceedings of the 4th International Workshop on Practice and Theory in Public Key Cryptography: Public Key Cryptography
| Hi-index | 0.00 |
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.