Question: 1. Consider the following hash function. Messages are in the form of a sequence of numbers in Zn, M = (a, a2,...,at). The hash

1. Consider the following hash function. Messages are in the form of a sequence of numbers in Zn, M = (a, a2,...,at). The hash value h is calculated as (t=1 a ) mod n for some predefined value n. (a) Does this hash function satisfy any of the requirements for a hash function listed bellow? Explain your answer for each case. It can be applied to a block of data of any size. (5 points) It produces a fixed-length output. (5 points) It is relatively easy to compute for any given input. (5 points) Preimage resistance. (10 points) . Secondary preimage resistance. (10 points) . Collision resistance. (10 points) (b) Compute the hash for M = (120, 145, 224, 657) for n = 981. (5 points)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
