Question: 8 . Hash # 2 Given a message M of size N and its crypto hash h ( M ) of size n bits, if

8. Hash #2
Given a message M of size N and its crypto hash h(M) of size n bits, if an adversary has to generate a new message M such that h(M)= h(M), the adversary has to try X number of messages on average where X is:
Correct!
a.2^(n/2)
b.2^ n
c.2^(N/2)
d.2^ N

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 Programming Questions!