For a n-bit hash function and m-bit messages, there are 2m-n (I,e; Two to the power m-n) messages per hash value. For example, m=1024 and n=128 there are XXXXXXXXXXtwo to the power 896) messages per...

For a n-bit hash function and m-bit messages, there are 2m-n (I,e; Two to the power m-n) messages per hash value. For example, m=1024 and n=128 there are 2 896 (two to the power 896) messages per hash value.

Still. Why is it difficult to find hash collision?