A new identification algorithm

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

Volumn 1029, Issue , 1996, Pages 244-249

  Chen, Kefei ^a  

^a JUSTUS LIEBIG UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ERROR CORRECTION;

IDENTIFICATION ALGORITHMS; MEMORY BITS; RANK DISTANCE; RANK-DISTANCE CODES;

CRYPTOGRAPHY;

EID: 84955563711     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: None     Document Type: Conference Paper

References (7)

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, IT-24(3) pp. 384-386, 1978.
2. K. Chen, Improved GirauU Identification Scheme, IEE Electronics Letters, Vol. 30, No. 19, pp. 1590-1591, 1994.
3. E. M. Gabidulin, Theory of Code with Maximum Rank Distance, Problems of Information Transmission, Vol. 21, pp. 1-12, 1985.
4. M. Girault, A (non-practical) three-pass identification protocol using coding theory, Proceedings of Auscrypt'90, LNCS Vol. 453, pp. 204-211, 1990.
5. S. Harari, A New Authentication Algorithm, Coding Theory and Applications, LNCS Vol. 388, pp. 204-211, 1989.
6. A. Shamir, An Efficient identification Scheme Based on Permuted Kernels, Proceedings of Crypto'89, Lecture Notes in Computer Science Vol. 435, pp. 606-609, 1990.
7. J. Stern, A New Identification Scheme Based on Syndrome Decoding, Proceedings of Crypto'93, Lecture Notes in Computer Science Vol. 773, pp. 13-21, 1994.