Tag Info

New answers tagged

2

When a hash function has an output of size n bits, then: The generic algorithm for finding a preimage (or a second preimage) has average cost 2n evaluations of the hash function. The generic algorithm for finding a collision has average cost about 2n/2 evaluations of the hash function. By "generic" we mean "the algorithm that works against every hash ...



Top 50 recent answers are included