Recall the Merkle-Damgard construction, which uses a compression function f : A A A. A basic version is given by: Wi f(W), m.) = where Wn is the output of the hash function, mim2... mn is the message and IV is a constant a. Discuss the simplest way you can think of to use AES-128 as a compression function in such a construction (1 mark) b. To achieve security, f must be a one-way function, meaning that given f(mi, m2) it should be very difficult to find any new information about (m1, m2). For example, if mi is known, it should still be difficult to find m2 and vice versa. Does your suggestion for the previous question satisfy this requirement? Why or why not? (1 mark) c. Modern hash functions have 256-bit outputs. Discuss how the security of your construction compares to modern hash functions with regards to collision resistance. (1 mark)