Cryptanalysis of Harari's identification scheme

  • Pascal Véron
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1025)


In this paper, it is shown that the first identification scheme based on a problem coming from coding theory, proposed in 1988 by S. Harari, is not secure.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 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–386Google Scholar
  2. 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–167Google Scholar
  3. 3.
    F. Chabaud: On the Security Of Some Cryptosystems Based On Error-Correcting Codes, Pre-proceedings of Eurocrypt'94, (1994) 127–135Google Scholar
  4. 4.
    U. Feige, A. Fiat & A. Shamir: Zero-knowledge proofs of identity, Proc. 19th ACM Symp. Theory of Computing, (1987), 210–217Google Scholar
  5. 5.
    A. Fiat, A. Shamir: How To Prove Yourself: Practical Solutions to Identification and Signatures Problems, Advances in Cryptology, Crypto'86, Lecture Notes in Computer Science 263, (1986) 186–194Google Scholar
  6. 6.
    M. Girault: A (non-practical) three-pass identification protocol using coding theory, Advances in Cryptology, Auscrypt'90, Lecture Notes in Computer Science 453, (1990) 265–272Google Scholar
  7. 7.
    S. Goldwasser, S. Micali and C. Rackoff: The knowledge complexity of interactive proof systems, Proc. 17th ACM Symp. Theory of Computing, (1985), 291–304Google Scholar
  8. 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–128Google Scholar
  9. 9.
    S. Harari: A New Authentication Algorithm, Proceedings of Coding Theory and Applications, Lecture Notes in Computer Science 388, (1988) 91–105Google Scholar
  10. 10.
    J.S. Leon: A probabilistic algorithm for computing minimum weights of large error-correcting codes, IEEE Trans. Inform. Theory, IT-34(5): 1354–1359Google Scholar
  11. 11.
    F.J. MacWilliams & N.J.A. Sloane: The Theory of error-correcting codes, North-Holland, Amsterdam-New-York-Oxford, 1977Google Scholar
  12. 12.
    C.P. Schnorr: Efficient signature generation by smart cards, Journal of Cryptology,:4, (1991) 161–174CrossRefGoogle Scholar
  13. 13.
    J. Stern: A method for finding codewords of small weight, Coding Theory and Applications, Lecture Notes in Computer Science 434, 173–180Google Scholar
  14. 14.
    J. Stern: A new identification scheme based on syndrome decoding, Crypto'93, Lecture Notes in Computer Science 773, Springer-Verlag (1994) 13–21Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1995

Authors and Affiliations

  • Pascal Véron
    • 1
  1. 1.G.E.C.T.Université de Toulon et du VarLa Garde CedexFrance

Personalised recommendations