The cryptographic security of the syndrome decoding problem for rank distance codes

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1163, Issue , 1996, Pages 368-381

  Chabaud, F ^a   Stern, J ^a  

^a ECOLE NORMALE SUPÉRIEURE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

DECODING; SECURITY OF DATA;

CRYPTOGRAPHIC SECURITY; ELEMENTARY OPERATIONS; LINEAR CODES; RANK DISTANCE; RANK-DISTANCE CODES; SYNDROME DECODING;

CRYPTOGRAPHY;

EID: 14844346471     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0034862     Document Type: Conference Paper

References (15)

1. [BMT78] E. R. Berlekamp, R. J. McEliece, and H. C. A. Vein Tilborg. On the inherent intractability of certain coding problems. IEEE Trans. Inform. Theory, IT-24(3): 384-386, May 1978.
2. [Che94] K. Chen. Improved Girault identification scheme. IEE Electronic Letters, 30(19): 1590-1591, sep 1994.
3. [Che96] K. Chen. A new identification algorithm. In Cryptography Policy and Algorithms conference, volume 1029, pages 244-249. LNCS, 1996.
4. [CL96] F. Chabaud and R. Lercier. Zen: A new toolbox for finite extensions in finite fields. Rapport de recherche, Laboratoire d'Informatique de Ecole Poly technique, 91128 Palaiseau Cedex, France, 1996. in preparation.
5. [FS96] J.-B. Fischer and J. Stem. An efficient pseudo-random generator provably as secure as syndrome decoding. In Advances m Cryptology-EUROCRYPT '96, volume to appear. LNCS, 1996.
6. [Gab85] E. M. Gabidulin. Theory of codes with maximum rank distance. Problems of Information Transmission, 21: 1-12, 1985.
7. [Gir90] M. Girault. A (non practical) three-pass identification protocol using coding theory. In Proc. Auscrypt'90, volume 453, pages 265-272. LNCS, 1990.
8. [Har89] S. Harari. A new authentication algorithm. In Coding Theory and Applications, volume 388, pages 204-211. LNCS, 1989.
9. [LN83] R. Lidl and H. Niederreiter. Finite fields. In Gian-Carlo Rota, editor, Encyclopedia of Mathematics and its applications. Addison-Wesley Publishing Company, 1983.
10. [MS83] F. J. MacWilliams and N. J. A. Sloane. The Theory of Error-correcting Codes. North-Holland, 1983.
11. [Ste] J. Stem. A new paradigm for public key identification. IEEE Trans. Inform. Theory, to be published.
12. [Ste90] J. Stem. An alternative to the Fiat-Shamir protocol. In Advances in Cryptology-EUROCRYPT '89, pages 173-180. LNCS, 1990.
13. [Ste94] J. Stern. A new identification scheme based on syndrome decoding. In Advances in Cryptology-CRYPTO '93, volume 773. LNCS, 1994.
14. [Vér95a] P. Véron. Cryptanalysis of Harari's identification scheme. In Cryptography and Coding, volume 1025, pages 264-269. LNCS, 1995.
15. [Vér95b] P. Véron. Problème SD, Opérateur Trace, Schemas d'identification et Codes de Goppa. PhD thesis, Université de Toulon et du Var, juillet 1995.