Thank you!

3. Given a 32-bit plaintext block and a 32-bit key , let (, ) = ( + ) mod 2^32

For example: if = and = , (, ) = ( + ) mod 2^32 = mod 2^32 =

Let be a compression function defined by using the Davies-Meyer construction with block cipher . Let be a hash function defined by using the Merkle-Damgrd construction using as the compression function and 0 = as the initial value for the 32-bit internal state.

Compute the chaining values 1, 2, 3, and 4 for the following message (broken into four 32-bit blocks): = (4pts each value)

Thank you!