Does the algorithm solve the problem of &quot;find me any two pieces of data that produce a clash&quot; (thereby taking advantage of the Birthday Paradox), or does it say &quot;given this piece of data, output data who&#x27;s SHA-1 sum is the same&quot;?<p>I assume that the second problem would be harder to solve - but I&#x27;m not sure by what order of magnitude. If it&#x27;s the former, what are the practical applications of the attack?