Abstract
In this note, we show that the signature scheme based on error-correcting codes which has been proposed during the ASIACRYPT'94 conference and appears in this volume (see [1]) is not secure. The attack involves gathering a few hundred signatures. ⩉From then on, only elementary linear algebra is used.
This is a preview of subscription content, log in via an institution to check access.
References
M. Alabbadi and S. B. Wicker, A digital signature scheme based on linear error-correcting block codes, this volume.
A. Fiat and A. Shamir, How to prove yourself: Practical solutions to identification and signature problems, Proceedings of Crypto 86, Lecture Notes in Computer Science 263, 181–187.
R. J. McEliece, Public key cryptosystem based on algebraic coding theory, JPLDSN Progress Report 42-44, Jet Propulsion Laboratory, California Institute of Technology, Pasadena, CA, USA, January and February 1978, 114–116.
J. Stern, A new identification scheme based on syndrome decoding. Proceedings of Crypto 93, Lecture Notes in Computer Science 773, 13–21.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Stern, J. (1995). Can one design a signature scheme based on error-correcting codes?. In: Pieprzyk, J., Safavi-Naini, R. (eds) Advances in Cryptology — ASIACRYPT'94. ASIACRYPT 1994. Lecture Notes in Computer Science, vol 917. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0000454
Download citation
DOI: https://doi.org/10.1007/BFb0000454
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59339-3
Online ISBN: 978-3-540-49236-8
eBook Packages: Springer Book Archive