Severely denting the Gabidulin version of the McEliece public key cryptosystem
Designs, Codes and Cryptography
Cryptoanalysis of the Original McEliece Cryptosystem
ASIACRYPT '98 Proceedings of the International Conference on the Theory and Applications of Cryptology and Information Security: Advances in Cryptology
Equivalent Goppa codes and trapdoors to McEliece's public key cryptosystem
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
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
PKC '02 Proceedings of the 5th International Workshop on Practice and Theory in Public Key Cryptosystems: Public Key Cryptography
Cryptanalysis of the Hwang-Rao Secret Error-Correcting Code Schemes
ICICS '01 Proceedings of the Third International Conference on Information and Communications Security
Code-based public-key cryptosystems and their applications
ICITS'09 Proceedings of the 4th international conference on Information theoretic security
Designing a rank metric based mceliece cryptosystem
PQCrypto'10 Proceedings of the Third international conference on Post-Quantum Cryptography
| Hi-index | 0.00 |
McEliece cryptosystem is a public-key cryptosystem based on error-correcting codes. It constitutes one of the few alternatives to cryptosystems relying on number theory. We present a modification of the McEliece cryptosystem which strengthens its security without increasing the size of the public key. We show that it is possible to use some properties of the automorphism groups of the codes to build decodable patterns of large weight errors. This greatly strengthens the system against the decoding attacks.