Statistical Decoding Revisited
In this paper we look at the statistical decoding attack on the McEliece cryptosystem from . The statistical decoding algorithm is a probabilistic algorithm for correcting errors in random codes. It uses precomptuations to provide faster error correction than the classical general decoding algorithms. We analyze the success probability of the algorithm and show how to improve it. Further, we show that the algorithm may not be used to attack the McEliece cryptosystem, due to the large amount of precomputation needed.
KeywordsMcEliece Cryptosystem general decoding coding theory public key cryptography code based cryptography
Unable to display preview. Download preview PDF.
- 2.Canteaut, A., Chabaud, F.: 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 511. IEEETIT: IEEE Transactions on Information Theory 44 (1998)Google Scholar
- 5.McEliece, R.J.: A public key cryptosystem based on algebraic coding theory. DSN progress report 42(44), 114–116 (1978)Google Scholar
- 6.Sendrier, N.: On the security of the McEliece public-key cryptosystem. In: Blaum, M., Farrell, P.G., van Tilborg, H. (eds.) Proceedings of Workshop honoring Prof. Bob McEliece on his 60th birthday, pp. 141–163. Kluwer, Dordrecht (2002)Google Scholar