Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

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

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Students also viewed these Databases questions

Question

1. Describe the factors that lead to productive conflict

Answered: 1 week ago