Abstract
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.
Cite
CITATION STYLE
APA
Véron, P. (1995). Cryptanalysis of Harari’s identification scheme. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1025, pp. 264–269). Springer Verlag. https://doi.org/10.1007/3-540-60693-9_28
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free