Cryptanalysis of Harari's identification scheme

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

Volumn 1025, Issue , 1995, Pages 264-269

  Véron, Pascal ^a  

^a UNIVERSITÉ DE TOULON   (France)

Author keywords

[No Author keywords available]

Indexed keywords

CODES (SYMBOLS); COMPUTER PROGRAMMING;

CODING THEORY; IDENTIFICATION SCHEME;

CRYPTOGRAPHY;

EID: 84858239914     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-60693-9_28     Document Type: Conference Paper

References (14)

1. E.R. Berlekamp, R.J. Mc Eliece & H.C.A. Van Tilborg: On the inherent intractability of certain coding problems, IEEE Trans. Inform. Theory, (1978) 384-386
2. A. Canteaut & H. Chabanne: A further improvement of the work factor in an attempt at breaking Mc Eliece's cryptosystem, Proceedings of Eurocode'94, (1994) 163-167
3. F. Chabaud: On the Security Of Some Cryptosystems Based On Error-Correcting Codes, Pre-proceedings of Eurocrypt'94, (1994) 127-135
4. U. Feige, A. Fiat & A. Shamir: Zero-knowledge proofs of identity, Proc. 19th ACM Symp. Theory of Computing, (1987), 210-217
5. A. Fiat, A. Shamir: How To Prove Yourself: Practiced Solutions to Identification and Signatures Problems, Advances in Cryptology, Crypto'86, Lecture Notes in Computer Science 263, (1986) 186-194
6. M. Giŕault: A (non-practical) three-pass identification protocol using coding theory, Advances in Cryptology, Auscrypt'90, Lecture Notes in Computer Science 453, (1990) 265-272
7. S. Goldwasser, S. Micali and C. Rackoff: The knowledge complexity of interactive proof systems, Proc. 17th ACM Symp. Theory of Computing, (1985), 291-304
8. L.C. Guillou and J.-J. Quisquater: A practical zero-knowledge protocol fitted to security microprocessor minimizing both transmission and memory, Advances in Cryptology, Eurocrypt'88, 330, (1988) 123-128
9. S. Harari: A New Authentication Algorithm, Proceedings of Coding Theory and Applications, Lecture Notes in Computer Science 388, (1988) 91-105
10. J.S. Leon: A probabilistic algorithm for computing minimum weights of large error-correcting codes, IEEE Trans. Inform. Theory, IT-34(5): 1354-1359
11. F.J. MacWilliams & N.J.A. Sloane: The Theory of error-correcting codes, North-Holland, Amsterdam-New-York-Oxford, 1977
12. C.P. Schnorr: Efficient signature generation by smart cards, Journal of Cryptology, 4, (1991) 161-174
13. J. Stem: A method for finding codewords of small weight, Coding Theory and Applications, Lecture Notes in Computer Science 434, 173-180
14. J. Stern: A new identification scheme based on syndrome decoding, Crypto'93, Lecture Notes in Computer Science 773, Springer-Verlag (1994) 13-21