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

IEEE Transactions on Information Theory

Volumn 44, Issue 1, 1998, Pages 367-378

  Canteaut, Anne ^a   Chabaud, Florent ^a  

^a INRIA   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CRYPTOGRAPHY; DECODING; ERROR CORRECTION;

BOSE CHAUDHURI HOCQUENGHAM (BCH) CODES; MCELIECE'S CRYPTOSYSTEMS; MINIMUM WEIGHT WORDS;

BINARY CODES;

EID: 0031675932     PISSN: 00189448     EISSN: None     Source Type: Journal    
DOI: 10.1109/18.651067     Document Type: Article

References (31)

1. E. Berlekamp, R. McEliece, and H. van Tilborg, "On the inherentintractability of certain coding problems," IEEE Trans. Inform. Theory, vol. IT-24, pp. 384-386, 1978
2. R. McEliece, "A public-key cryptosystem based on algebraic coding theory," Jet Propulsion Lab. DSN Progress Rep., pp. 114-116, 1978
3. H. Niederreiter, "Knapsack-type cryptosystems and algebraic coding theory," Probl. Contr. and Inform. Theory, vol. 15, pp. 159-166, 1986
4. J. Stern, "A new identification scheme based on syndrome decoding," in Advances in Cryptology-CRYPTO'93, D. Stinson, Ed. New York: Springer-Verlag, 1993, pp. 13-21
5. P. Véron, "Problème SD, Opérateur Trace, schémas d'identification et codes de Goppa," Ph.D. dissertation, Univ. de Toulon et du Var, 1995
6. F. Chabaud, Recherche de performance dans l'algorithmique des corpsfinis. Applications àla cryptographie," Ph.D. dissertation, Ecole Polytechnique, 1996
7. P. Lee and E. Brickell, "An observation on the security of McEliece's public-key cryptosystem," in Advances in Cryptology-EUROCRYPT '88, C. Günter, Ed. New York: Springer-Verlag, 1988, pp. 275-280
8. J. Léon, "A probabilistic algorithm for computing minimum weights of large error-correcting codes," IEEE Trans. Inform. Theory, vol. 34, pp. 1354-1359, 1988
9. 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
10. F. Chabaud, "On the security of some cryptosystems based onerrorcorrecting codes," in Advances in Cryptology-EUROCRYPT'94, A. De Santis, Ed. New York: Springer-Verlag, 1994, pp. 131-139.
11. J. Omura, "Iterative decoding of linear codes by a modulo-2 linearpro gramm," Discr. Math., no. 3, pp. 193-208, 1972
12. J. van Tilburg, "On the McEliece public-key cryptosystem," in Advances in Cryptology-CRYPTO'88, S. Goldwasser, Ed. New York: SpringerVerlag, 1988, pp. 119-131
13. A. Canteaut and H. Chabanne, "A further improvement of the work fac- tor in an attempt at breaking McEliece's cryptosystem," in EUROCODE 94-Livre des Resumes, P. Charpin, Ed., INRIA, 1994.
14. J. Kemeny and J. Snell, Finite Markov Chains. New York: SpringerVerlag, 1960.
15. E. Brickell and A. Odlyzko, "Cryptanalysis: A survey of recent results, in Contemporary Cryptology-The Science of Information Integrity, G Simmons, Ed. New York: IEEE Press, 1992, pp. 501-540.
16. Y. Li, R. Deng, and X. Wang, "On the equivalence of McEliece's an Niederreiter's public-key cryptosystems," IEEE Trans. Inform. Theory vol. 40, pp. 271-273, 1994.
17. A. Canteaut, "Attaques de cryptosystèmes àmots de poids faible e construction de fonctions i-résilientes," Ph.D. dissertation, Univ. Pari 6, 1996.
18. N. Sendrier, "An algorithm for finding the permutation between tw equivalent binary codes," Tech. Rep. RR-2853, INRIA, Apr. 1996.
19. V. Sidelnikov and S. Shestakov, "On cryptosystems based on generalized Reed-Solomon codes," Diskret. Mat., vol. 4, pp. 57-63, 1992.
20. N. Sendrier, "On the structure of a randomly permuted concatenate code," in EUROCODE 94-Livre des resumes, P. Charpin, Ed., INRIA 1994, pp. 169-173.
21. N. Sendrier, "On the structure of a randomly permuted concatenate code," Tech. Rep. RR-2460, INRIA, Jan. 1995.
22. J. van Tilburg, "Security-analysis of a class of cryptosystems base on linear error-correcting codes," Ph.D. dissertation, Tech. Univ. Eindhoven, Eindhoven, The Netherlands, 1994.
23. C. Adams and H. Meijer, "Security-related comments regardin McEliece's public-key cryptosystem," in Advances in Cryptology-CRYPTO'87, C. Pomerance, Ed. New York: Springer-Verlag 1987, pp. 224-228.
24. D. Augot, P. Charpin, and N. Sendrier, "Studying the locator polynomia of minimum weight codewords of BCH codes," IEEE Trans. Inform Theory, vol. 38, pp. 960-973, 1992.
25. F. Mac Williams and N. Sloane, The Theory of Error-Correcting Codes Amsterdam, The Netherlands: North-Holland, 1977.
26. T. Kasami, S. Lin, and W. Peterson, "Some results on cyclic codes whic are invariant under the affine group," Tech. Rep. AFCRL-66-622, Ai Force Cambridge Res. Labs., Bedford, MA, 1966.
27. T. Kasami and S. Lin, "Some results on the minimum weight o primitive BCH codes," IEEE Trans. Inform. Theory, vol. IT-18, pp 824-825, 1972.
28. H. Helgert and R. Stinaff, "Shortened BCH codes," IEEE Trans. Inform Theory, vol. IT-19, pp. 818-820, 1973.
29. D. Augot and N. Sendrier, "Idempotents and the BCH bound," IEE Trans. Inform. Theory, vol. 40, pp. 204-207, 1994.
30. T. Kasami and N. Tokura, "Some remarks on BCH bounds and minimu weights of primitive binary BCH codes," IEEE Trans. Inform. Theory vol. IT-15, pp. 408-413, 1969.
31. E. Farr, unpublished.