Abstract
In this work we present a new authentication algorithm with modified versions suitable for identification and signature. It uses error correcting codes and binary field arithmetic. It has the property that counterfeiting attacks are equivalent to solving NP complete problems. It is easy to implement and is economical in computing power and memory.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
Fiat, Shamir How to prove yourself:practical solutions to identification and signature problems Technical report, The Weitzman Institute of Science, Rehovot Israel 1986.
E.R.Berlekamp, R.J.McEliece, HCA vanTilborg, On the Inherent Intactability of certain coding problems IEEE Transactions on Information Theory IT 24 no 3 pp 384–386.
S. Harari Application des codes correcteurs au partage du secret Traitement du Signal vol.4 no 4 1987 pp. 353–356.
F.J.Macwilliams N.J.A. Sloane, The theory of error correcting codes NorthHolland 1977.
S.Goldwasser, S.Micali, and C.Rackof, The knowledge complexity of interactive proof systems 17th ACM Symp. on Theory of Computing May 1985,pp291–304.
W. Diffie and M. Hellman, New directions in cryptography IEEE Transactions on Inf. Theory IT22 (1976) 644–654.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1989 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Harari, S. (1989). A new authentication algorithm. In: Cohen, G., Wolfmann, J. (eds) Coding Theory and Applications. Coding Theory 1988. Lecture Notes in Computer Science, vol 388. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0019849
Download citation
DOI: https://doi.org/10.1007/BFb0019849
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-51643-9
Online ISBN: 978-3-540-46726-7
eBook Packages: Springer Book Archive