1.

2.

Consider the hash function h:{0,1}n{0,1} which takes input m=m1m2mn and outputs m1m2mn, i.e., the XOR of the input bits of m. Is it true that h is preimage resistant? True False Let f:{0,1}n{0,1}m be a cryptographic hash function that is preimage resistant and second preimage resistant. Note that its input is an n-bit string. To allow hashing a string of 2n bits, the function g:{0,1}n{0,1}n{0,1}m is constructed from f by g(x,y)=f(xy), where denotes bitwise XOR. Which of the following statement is correct? g is not preimage resistance. g is second preimage resistance. g is preimage resistance. g is not second preimage resistance. g is not preimage resistance. g is not second preimage resistance. g is preimage resistance. g is second preimage resistance