Question: Consider the following hash function. Messages are in the form of a sequence of numbers in Z _ n , M =

Consider the following hash function. Messages are in the form of a sequence of
numbers in Z_n,\ M\=\(a_1,\ a_2,\...,a_t). The hash value h is calculated as (\sum_{i=1}^{t}{a_i^2)}mod\ n for some predefined value n.
Does this hash function satisfy any of the requirements for a hash function listed below? Explain your answer for each case.
It can be applied to a block of data of any size.
It produces a fixed-length output.
It is relatively easy to compute for any given input.
Preimage resistance.
Secondary preimage resistance.
Collision resistance.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!