Abstract
This paper introduces a new decoding algorithm for general linear block codes. The algorithm generates a direct estimate of the error locations based on exploiting the statistical information embedded in the classical syndrome decoding. The algorithm can be used to cryptanalyze many algebraic-code public-key crypto and identification systems. In particular results show that the McEliece public-key cryptosystem with its original parameters is not secure.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
A. Al Jabri,“A new Class Of Attacks On McEliece Public-Key and Related Cryptosystems,” The 2001 Canadian Workshop On Information Theory, Vancouver, British Columbia, June 3–6, 2001.
A. Canteaut and F. Chabaud,“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 611”, IEEE Trans. Inform. Theory, vol. IT-44(1), pp. 367–378, 1998.
P.J. Lee and E.F. Brickell,“An Observation on the Security of McEliece’s Public-Key Cryptosystem”, in Lecture Notes in Computer Science 330, Advances in Cryptology: Proc. Eurocrypt’88, C.G. Gunther, Ed., Davos, Swizerland, May 25–27, 1988, pp. 275–280, Berlin: Springer-Verlag, 1988.
R. J. McEliece, “A Public-Key Cryptosystem Based on Algebraic Coding Theory”, DSN Progress Report 42-44, pp. 114–116, Jet Propulsion Laboratory, CA, Jan–Feb 1978.
F.J. McWilliams and N.J. Sloane,“The theory of error correcting codes”, North Publishing Co. 3rd ed.,North Mathematical Library, Vol. 16, Netherlands 1983.
A. Papoulis, “Probability, Random Variables, and Stochastic Processes,” McGraw-Hill, New York, 1965.
J. Stern “A method for finding codewords of small weight,” in Coding Theory and Applications, G. Cohen and J. Wolfmann, Eds, New York, Springer-Verlag, 1989, pp. 106–113.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2001 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jabri, A.A. (2001). A Statistical Decoding Algorithm for General Linear Block Codes. In: Honary, B. (eds) Cryptography and Coding. Cryptography and Coding 2001. Lecture Notes in Computer Science, vol 2260. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45325-3_1
Download citation
DOI: https://doi.org/10.1007/3-540-45325-3_1
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43026-1
Online ISBN: 978-3-540-45325-3
eBook Packages: Springer Book Archive