A Statistical Decoding Algorithm for General Linear Block Codes
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.
KeywordsDecoding General Linear Block Codes McEliece System Statistical
Unable to display preview. Download preview PDF.
- 1.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.Google Scholar
- 3.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.Google Scholar
- 4.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.Google Scholar
- 5.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.Google Scholar