On the Concatenated Structure of a Linear Code

Applicable Algebra in Engineering, Communications and Computing

Volumn 9, Issue 3, 1998, Pages 221-242

  Sendrier, Nicolas ^a  

^a INRIA   (France)

Author keywords

Code equivalence; Concatenated codes; McEliece cryptosystem; Niederreiter cryptosystem

Indexed keywords

CODES (SYMBOLS); CRYPTOGRAPHY;

CODE EQUIVALENCE; CONCATENATED STRUCTURE; LINEAR CODES; MCELIECE CRYPTOSYSTEMS; NIEDERREITER CRYPTOSYSTEMS;

MATRIX ALGEBRA;

EID: 0032292220     PISSN: 09381279     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002000050104     Document Type: Article

References (19)

1. Augot, D., Camion, P.: The minimal polynomials, characteristic subspaces, normal bases and the Frobenius form. Rapport de Recherche 2006, INRIA, August 1993
2. Berlekamp, E.R., McEliece, R.J., van Tilborg, H.C.: On the inherent intractability of certain coding problems. IEEE Trans Inform Theory, 24(3), 384-386 (1978)
3. Canteaut, A., Chabanne, H.: A further improvement of the work factor in an attempt at breaking McEliece cryptosystem. In: P. Charpin (ed), Livre des résumé - EUROCODE 94, pp 163-167, Abbaye de la Bussière sur Ouche, France, October 1994. INRIA
4. 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. IEEE Trans Inform Theory, 44(1), 367-378 (1998)
5. Cohen, G., Lempel, A.: Linear intersecting codes. Discrete Math, 56, 35-43 (1985)
6. Hwang, T.Y.: Decoding linear block codes for minimizing word error rate. IEEE Trans Inform Theory 25(6), 733-737 (1979)
7. Janwa, H., Moreno, O.: McEliece public key cryptosystems using algebraic-geometric codes. Des Codes Cryptography 8, 293-307 (1996)
8. Lee, P.J., Brickell, E.F.: An observation on the security of McEliece's public-key cryptosystem. In: Günther, C.G.(ed) Advances in Cryptology - EUROCRYPT'88, in LNCS 330 pp 275-280. Berlin Heidelberg New York: Springer, 1988
9. Leon, J.S.: Computing automorphism groups of error-correcting codes. IEEE Trans Inform Theory 28(3), 496-511 (1982)
10. Leon, J.S.: A probabilistic algorithm for computing minimum weights of large error-correcting codes. IEEE Trans Inform Theory, 34(5), 1354-1359 (1988)
11. MacWilliams, F.J., Sloane, N.J.A.: The Theory of Error-Correcting Codes. Amsterdam: North-Holland 1977
12. Massey, J.L.: Minimal codewords and secret sharing. In: Sixth joint Swedish-Russian Internationnal Workshop on Information Theory, pp 246-249, Mölle, Sweden, August 1993
13. McEliece, R.J.: A public-key cryptosystem based on algebraic coding theory. DSN Prog. Rep., Jet Prop. Lab., California Inst. Technol., Pasadena, CA, pp 114-116, January 1978
14. Niederreiter, H.: Knapsack-type crytosystems and algebraic coding theory. Prob Contr Inform Theory 15(2), 157-166 (1986)
15. e cycle, Université Scientifique Technologique et Médicale de Grenoble, 1987
16. Sendrier, N.: Un algorithme pour trouver la permutation entre deux codes binaires équivalents. Rapport de Recherche 2853, INRIA, April 1996
17. Sendrier, N.: Finding the permutation between equivalent binary codes. In: IEEE Conference, ISIT'97, Ulm, Germany, June 1997
18. Sidelnikov, V.M., Shestakov, S.O.: On cryptosystem based on generalized Reed-Solomon codes. Discrete Math (in russian), 4(3), 57-63 (1992)
19. Stern, J.: A method for finding codewords of small weight. In: Cohen, G., Wolfmann, J.(ed) Coding theory and applications, LNCS 388, pp 106-113, Berlin Heidelberg New York: Springer 1989