Question: Consider the following compression function C(x) which takes 3 bits input and outputs 2 bits: 000 001 010 011 100 101 110 111 C(x)

Consider the following compression function C(x) which takes 3 bits input and outputs 2 bits: 000 001 010 011 100 101 110 111 C(x) 10 11 10 10 11 00 01 10 Let H(x) be the hash function obtained from C(x) using the Merkle-Damgard construction (using initial value hi = 00). Compute H(10001). Only enter a string of 0's and 1's.
Step by Step Solution
3.47 Rating (167 Votes )
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
