Cryptanalysis of the Original McEliece Cryptosystem
- 1 January 2000
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 187-199
- https://doi.org/10.1007/3-540-49649-1_16
Abstract
The class of public-key cryptosystems based on error-correcting codes is one of the few alternatives to the common algorithms based on number theory.We here present an attack against these systems which actually consists of a new probabilistic algorithm for finding minimum-weight words in any large linear code. This new attack notably points out that McEliece cipher with its original parameters does not provide a sufficient security level.Keywords
This publication has 5 references indexed in Scilit:
- A method for finding codewords of small weightPublished by Springer Science and Business Media LLC ,2005
- A new algorithm for finding minimum-weight words in a linear code: application to McEliece's cryptosystem and to narrow-sense BCH codes of length 511IEEE Transactions on Information Theory, 1998
- A probabilistic algorithm for computing minimum weights of large error-correcting codesIEEE Transactions on Information Theory, 1988
- An Observation on the Security of McEliece’s Public-Key CryptosystemLecture Notes in Computer Science, 1988
- Iterative decoding of linear codes by a modulo-2 linear programDiscrete Mathematics, 1972