Question: 3. Alice designs a new hash function H: give a message M, she first chops the message into 128-bit blocks, B1, B2, B3, compute the

3. Alice designs a new hash function H: give a message M, she first chops the message into 128-bit blocks, B1, B2, B3, compute the hash H(M) by XORing all blocks then XORing a given 128-bit sequence S that is known to everyone; that is, H(M)= B1 XOR B2 XOR B3 XOR S. Is this hash function good and why?

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!