On the security of some cryptosystems based on error-correcting codes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 950, Issue , 1995, Pages 131-139

  Chabaud, Florent ^a  

^a Laboratoire d’lnformatique de l’ENS ^*  (France)

Author keywords

[No Author keywords available]

Indexed keywords

NUMBER THEORY;

ERROR CORRECTING CODE; PUBLIC KEY CRYPTOSYSTEMS;

PUBLIC KEY CRYPTOGRAPHY;

EID: 84948963042     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0053430     Document Type: Conference Paper

References (12)

1. C. Adams and H. Meijer. Security-related comments regarding McEliece’s public-key cryptosystem. In Lecture Notes in Computer Science, Advances in Cryptology - CRYPTO ’’87, pages 221-228. Springer-Verlag, 1988.
2. E.R. Berlekamp. Goppa codes. IEEE Trans. Inform. Theory, IT-19(5):590-592, September 1973.
3. E. R. Berlekamp, R.J. McEliece, and H.C.A. Van Tilborg. On the inherent intractability of certain coding problems. IEEE Trans. Inform. Theory, IT-24(3):384-386, May 1978.
4. F. Chabaud. Asymptotic analysis of probabilistic algorithms for finding short codewords. In CISM Courses and Lectures - EUROCODE ’’92, volume 339, pages 175-183. Springer-Verlag, 1993.
5. P.J. Lee and E.F. Brickell. An observation on the security of McEliece’s public-key cryptosystem. In Lecture Notes in Computer Science, Advances in Cryptology - EUROCRYPT ’’88, pages 275-280. Springer-Verlag, 1989.
6. J.S. Leon. A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEE Trans. Inform. Theory, IT-34(5):1354-1359, September 1988.
7. R.J. McEliece. A public-key cryptosystem based on algebraic coding theory. DSN progress report 42-44, pages 114-116, 1978.
8. F.J. Mac Williams and N.J.A. Sloane. The Theory of Error-correcting Codes. North-Holland, 1983.
9. V.M. Sidelnikov and S.O. Shestakov. On cryptosystems based on generalized Reed-Solomon codes. Diskretnaya Math, 4:57-63, 1992. in Russian.
10. V.M. Sidelnikov and S.O. Shestakov. On unsecurity of cryptosystems based on generalized Reed-Solomon codes, manuscript, 1992.
11. J. Stern. A method for finding codewords of small weight. In Lecture Notes in Computer Science, Coding Theory and Applications, volume 388, pages 106-113. Springer, 1989.
12. G. Cohen and J. Wolfmann editors. J. Stern. A new identification scheme based on syndrome decoding. In Proceedings of CRYPTO ’’93, 1993. to appear.