a) If user A and user B decide to use a hash function where thehash output is a 512-bits-long binary string, given a message M andits corresponding hash output H(M), how many attempts an attackerhave to make to find another message m’≠ m that has the same hashoutput?
b) If user A and user B decide to use a hash function where thehash output is a 512-bits-long binary string, given a message M andits corresponding hash output H(M), how many attempts would anattacker have to make to find two messages m and m’ that are notthe same, but have the same
OR
OR