Abstract
A method is described to generate collisions for the hash function FFT-Hash that was presented by Claus Schnorr at Crypto '91. A set of colliding messages is given that was obtained by this method.
Preview
Unable to display preview. Download preview PDF.
References
C Schnorr, FFT-Hash, An Efficient Cryptographic Hash Function,Rump Session Crypto '91.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Daemen, J., Bosselaers, A., Govaerts, R., Vandewalle, J. (1993). Collisions for Schnorr's hash function FFT-Hash presented at Crypto '91. In: Imai, H., Rivest, R.L., Matsumoto, T. (eds) Advances in Cryptology — ASIACRYPT '91. ASIACRYPT 1991. Lecture Notes in Computer Science, vol 739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57332-1_41
Download citation
DOI: https://doi.org/10.1007/3-540-57332-1_41
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-57332-6
Online ISBN: 978-3-540-48066-2
eBook Packages: Springer Book Archive