Question: If user A and user B decide to use a hash function where the hash output is a 512-bits-long binary string, given a message M

If user A and user B decide to use a hash function where the hash output is a 512-bits-long binary string, given a message M and its corresponding hash output H(M), how many attempts an attacker have to make to find another message m=? m that has the same hash output?

If user A and user B decide to use a hash function where the hash output is a 512-bits-long binary string, given a message M and its corresponding hash output H(M), how many attempts would an attacker have to make to find two messages m and m that are not the same, but have the same hash output?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!