Abstract
A certain number of public-key cryptosystems based on error-correcting codes have been proposed as an alternative to algorithms based on number theory. In this paper, we analyze algorithms that can be used to attack such cryptosystems in a very precise way, and optimize them. Thus, we obtain some more efficient attacks than those previously known. Even if they remain unfeasible, they indicate the cryptosystems parameters forbidden by the existence of these algorithms.
On leave from Délégation Générale de l'Armement.
Supported by the Centre National de Recherche Scientifique URA 1327.
Chapter PDF
References
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.
E.R. Berlekamp. Goppa codes. IEEE Trans. Inform. Theory, IT-19(5):590–592, September 1973.
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.
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.
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.
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.
R.J. McEliece. A public-key cryptosystem based on algebraic coding theory. DSN progress report 42-44, pages 114–116, 1978.
F.J. MacWilliams and N.J.A. Sloane. The Theory of Error-correcting Codes. North-Holland, 1983.
V.M. Sidelnikov and S.O. Shestakov. On cryptosystems based on generalized Reed-Solomon codes. Diskretnaya Math, 4:57–63, 1992. in Russian.
V.M. Sidelnikov and S.O. Shestakov. On unsecurity of cryptosystems based on generalized Reed-Solomon codes. manuscript, 1992.
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. G. Cohen and J. Wolfmann editors.
J. Stern. A new identification scheme based on syndrome decoding. In proceedings of CRYPTO '93, 1993. to appear.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chabaud, F. (1995). On the security of some cryptosystems based on error-correcting codes. In: De Santis, A. (eds) Advances in Cryptology — EUROCRYPT'94. EUROCRYPT 1994. Lecture Notes in Computer Science, vol 950. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0053430
Download citation
DOI: https://doi.org/10.1007/BFb0053430
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-60176-0
Online ISBN: 978-3-540-44717-7
eBook Packages: Springer Book Archive