On the complexity of some cryptographic problems based on the general decoding problem

IEEE Transactions on Information Theory

Volumn 48, Issue 10, 2002, Pages 2669-2678

  Johansson, Thomas ^a,b   Jönsson, Fredrik ^a,b  

^a IEEE   (Sweden)

^b LUND UNIVERSITY   (Sweden)

Author keywords

Complexity; Correlation attack; Decoding algorithms; McEliece cryptosystem; Stern identification scheme

Indexed keywords

CRYPTOGRAPHIC PROBLEMS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; PROBLEM SOLVING; PUBLIC KEY CRYPTOGRAPHY;

DECODING;

EID: 0036794609     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/TIT.2002.802608     Document Type: Article

References (19)

1. E.R. Berlekamp, R.J. McEliece, and H.C.A. van Tilborg, "On the inherent intractability of certain coding problems," IEEE Trans. Inform. Theory, vol. IT-24, pp. 384-386, May 1973.
2. A. Canteaut and F. Chabaud, "A new algorithm for finding minimum-weight words in a linear code: Application to McEliece cryptosystem and to narrow-sense BCH codes of length 511," IEEE Trans. Inform. Theory, vol. 44, pp. 367-378, Jan. 1998.
3. F. Chabaud, "On the security of some cryptosystems based on error-correcting codes," in Advances in Cryptology-EUROCRYPT'94 (Lecture Notes in Computer Science). Berlin, Germany: Springer-Verlag, 1994, pp. 131-139.
4. N. Courtois, M. Finiasz, and N. Sendrier, "How to achieve a McEliece-based digital signature scheme," in Advances in Cryptology-ASIACRYPT 2001 (Lecture Notes in Computer Science). Berlin Germany: Springer-Verlag, 2001, vol. 2248, pp. 157-174.
5. V. Chepyshov and B. Smeets, "On a fast correlation attack on certain stream ciphers," in Advances in Cryptology-EUROCRYPT'91 (Lecture Notes in Computer Science), D.W. Davies, Ed. Berlin, Germany: Springer-Verlag, 1991, vol. 547, pp. 176-185.
6. J. Kemeny and J. Snell, Finite Markov Chains. Berlin, Germany: Springer-Verlag, 1960.
7. P.J. Lee and E.F. Brickell, "An observation on the security of McEliece public-key cryptosystem," in Advances in Cryptology-EUROCRYPT'88 (Lecture Notes in Computer Science), C.G. Günther, Ed. Berlin, Germany: Springer-Verlag, 1989, vol. 330, pp. 275-280.
8. J.S. Leon, "A probabilistic algorithm for computing minimum weights of large error-correcting codes," IEEE Trans. Inform. Theory, vol. 34, pp. 1354-1359, Sept. 1988.
9. F.J. MacWilliams and N. Sloane, The Theory of Error-Correcting Codes. Amsterdam, The Netherlands: North-Holland, 1977.
10. R.J. McEliece, "A public-key cryptosystem based on algebraic coding theory," DSN Progr. Rep., pp. 114-116, 1978.
11. A. Menezes, P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography. Boca Raton, FL: CRC, 1997.
12. H. Niederreiter, "Knapsack-type cryptosystems and algebraic coding theory," Probl. Contr. Inform. Theory, vol. 15, pp. 159-166, 1986.
13. W. Meier and O. Staffelback, "Fast correlation attacks on certain stream ciphers," J. Cryptol., vol. 1, pp. 159-176, 1989.
14. J. Stern, "A method for finding codewords of small weight," in Coding Theory and Applications (Lecture Notes in Computer Science), G. Cohen and J. Wolfman, Eds. Berlin, Germany: Springer-Verlag, 1989, vol. 388, pp. 106-113.
15. _, "A new identification scheme based on syndrome decoding," in Advances in Cryptology-CRYPTO'93 (Lecture Notes in Computer Science), D.R. Stinson, Ed. Berlin, Germany: Springer-Verlag, 1994, vol. 773, pp. 13-21.
16. H.C.A. van Tilborg, "Coding theory at work in cryptology and vice versa," in Handbook of Coding Theory, V.S. Pless and W.C. Huffman, Eds. Amsterdam, The Netherlands: North-Holland, 1998, vol II, pp. 1195-1227.
17. J. van Tilburg, "Security-analysis of a class of cryptosystems based on linear error-correcting codes," Ph.D. dissertation, Tech. Univ. Eindhoven, Eindhoven, The Netherlands, 1994.
18. A. Vardy, "The intractability of computing the minimum distance of a code," IEEE Trans. Inform. Theory, vol. 43, pp. 1757-1766, Nov. 1997.
19. P. Véron, "Problème SD, Opéateur Trace, schémas d'identification et codes de Goppa," Ph.D. dissertation, Univ. Toulon et du Var, Toulon, France, 1995.