Abstract
We investigate the possibility of using error correcting codes in digital signatures. A scheme combining one way functions and a MDS code is presented and analyzed. We then study an attack upon this scheme and upon more general ones called “random knapsack schemes” involving a linear combination Σi T(x) i,i) of the message elements x i.
Chapter PDF
Similar content being viewed by others
Keywords
- Signature Scheme
- Parity Check Matrix
- Probabilistic Algorithm
- Digital Signature Scheme
- Error Correction Algorithm
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
D.W. Davies and W.L. Price, “Security for computer Networks”, John Wiley and Sons, Chichester 1984.
R.R. Jueneman, “A High Speed Manipulation Detection Codes”, Proceeding of crypto 86, Springer-Verlag 1987, pp.327–346.
M. Campana and M. Girault, “How to Use Compressed Encoding Mechanisms in Data Protection”, Securicom 88, March 15–17, pp.91–110.
P. Camion, “Can a Fast signature Scheme Without Secret Key be Secure?”, in AAECC, Lecture Notes in Computer Science, no228, Springer-Verlag.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1988 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Godlewski, P., Camion, P. (1988). Manipulations and Errors, Detection and Localization. In: Barstow, D., et al. Advances in Cryptology — EUROCRYPT ’88. EUROCRYPT 1988. Lecture Notes in Computer Science, vol 330. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45961-8_9
Download citation
DOI: https://doi.org/10.1007/3-540-45961-8_9
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-50251-7
Online ISBN: 978-3-540-45961-3
eBook Packages: Springer Book Archive