First SHA-1 collision, birthday paradox, should you rehash your will?
One of the most important properties of a cryptographic hash function is that of “Strong collision-resistance“, that is, it should be “computationally infeasible” to find distinct inputs x, x’ such that hash(x) = hash(x’).
For the SHA-1 hash function, which generates a 160 bit hash, to have strong collision resistance, only ... read more