Problem 3: Let M be a sequence of 160 bits. We write Sr(M) for asequence obtained from M by shifting its bits r positions to theleft (cyclically). Suppose a message m is divided into blocks oflength 160 bits: m = M1 ◦ M2 ◦ . . . ◦ Ml (with the last blockpadded with random bits, if necessary). Let h(m) = S0(M1) ⊕ S1(M2)⊕ S2(M3) ⊕ . . . ⊕ Sl−1(Ml). which of the properties (1), (2) and(3) of of cryptographic hash functions does h satisfy? Justify youranswers. Does H satisfy the weak collision freeness? Again,explain.
Solution