How to mask the structure of codes for a cryptographic use

Designs, Codes, and Cryptography

Volumn 35, Issue 1, 2005, Pages 63-79

  Berger, Thierry P ^a   Loidreau, Pierre ^b  

^a UNIVERSITY OF LIMOGES   (France)

^b Natl Inst of Advanced Technologies   (France)

Author keywords

Gabidulin codes; GPT cryptosystem; Niederreiter cryptosystem; Reed solomon codes; Subcodes

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; DECODING; MATRIX ALGEBRA; PROBLEM SOLVING; VECTORS;

GPT CRYPTOSYSTEM; NIEDERREITER CRYPTOSYSTEM; REED-SOLOMON CODES; SUBCODES;

PUBLIC KEY CRYPTOGRAPHY;

EID: 14844342361     PISSN: 09251022     EISSN: None     Source Type: Journal    
DOI: 10.1007/s10623-003-6151-2     Document Type: Article

References (17)

1. A. Canteaut F. Chabaud 1998 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
2. A. Canteaut and N. Sendrier, Cryptanalysis of the original McEliece cryptosystem, In (K. Ohta and D. Pei eds.), Advances in Cryptology - ASIACRYPT'98, number 1514 in LNCS (1998) pp. 187-199.
3. F. Chabaud and J. Stern, The cryptographic security of the syndrome decoding problem for rank distance codes, In (K. Kim and T. Matsumoto eds.), Advances in Cryptology - ASIACRYPT '96, volume 1163 of LNCS. Verlag (1996).
4. A. Dür 1987 The automorphism group of Reed-Solomon codes J. Comb. Theory, series A 44 69 82
5. A. Ourivski, E. Gabidulin and V. Pavlouchkov, On the modified Niederreiter cryptosystem, in the Proceedings of the Information Theory and Networking Workshop, ITW(1999) p.50.
6. E. M. Gabidulin, Theory of codes with maximal rank distance, Problems Inform. Transm., vol. 21 (1985).
7. E. M. Gabidulin and A. V. Ourivski, Improved GPT public-key cryptosystems, In (P. Farrell, M. Darnell and B. Honary eds.), Coding Communications and Broadcasting (2000) pp. 73-102.
8. E. M. Gabidulin A. V. Paramonov O. V. Tretjakov 1991 Ideals over a non-commutative ring and their application in cryptology LNCS 573 482 489
9. J. K. Gibson 1995 Severely denting the Gabidulin version of the McEliece public-key cryptosystem Designs, Codes and Cryptography 6 37 45
10. J. K. Gibson, The security of the Gabidulin public-key cryptosystem, In (U. Maurer ed.), EUROCRYPT'96 (1996) pp. 212-223.
11. P. J. Lee and E. F. Brickell, An observation on the security of McEliece's public-key cryptosystem, In (C. G. Günter ed.), Advances in Cryptology - EUROCRYPT'88, volume 330 of LNCS, Verlag (1988) pp. 275-280.
12. P. Loidreau N. Sendrier 2001 Weak keys in McEliece public-key cryptosystem IEEE Trans. Inform. Theory 47 3 1207 211
13. F. J. MacWilliams and N. J. A. Sloane, The Theory of Error-Correcting Codes. North Holland (1977).
14. R. J. McEliece, A public-key cryptosystem based on algebraic coding theory, Technical report, Jet Propulsion Lab. DSN Progress Report (1978).
15. H. Niederreiter 1986 Knapsack-type cryptosystems and algebraic coding theory Problems of Control Inform. Theory 15 2 159 166
16. R. M. Roth G. Seroussi 1985 On generator matrices of MDS codes IEEE Trans. Inform. Theory 31 6 826 830
17. V. M. Sidel'nikov S. O. Shestakov 1992 On cryptosystems based on generalized Reed-Solomon codes Discrete Mathematics 4 3 57 63