Abstract
The FFT Hashing Function proposed by C.P. Schnorr [1] hashes messages of arbitrary length into a 128-bit hash value. In this paper, we show that this function is not collision free, and we give an example of two distinct 256-bit messages with the same hash value. Finding a collision (in fact a large family of, colliding messages) requires approximately 223 partial computations of the hash function, and takes a few hours on a SUN3- workstation, and less than an hour on a SPARC-workstation.
Cite
CITATION STYLE
Baritaud, T., Gilbert, H., & Girault, M. (1993). F.F.T. hashing is not collision-free. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 658 LNCS, pp. 35–44). Springer Verlag. https://doi.org/10.1007/3-540-47555-9_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
