Parallel Collision Search with Cryptanalytic Applications

By P. V. Oorschot, Michael J. Wiener. Journal of Cryptology, 2013

411 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

The First Collision for Full SHA-1 (2017, background): “The issues raised here could all be addressed in principle by carefully implementing, say van Oorschot and Wiener’s parallel collision search on a cluster of efficient platforms [33].”
Estimating Renyi Entropy of Discrete Distributions (2014, background): “In particular, the Rényi entropy of order 2, H2(p), measures the quality of random number generators [19], [30], determines the number of unbiased bits that can be extracted from a physical source of randomness [6], [14], helps test graph expansion [8] and closeness of distributions [5], [34], and c”
Introduction to Modern Cryptography, Second Edition (2014, neutral): “The possibility of parallelizing collision-finding attacks, which can offer significant speedups in practice, is discussed in [170].”