Assume that we have a hash function like this: Break the messageinto blocks of 20 bytes and treat them as positive integers. Thehash value would be the sum of the first block, the square of thesecond block, the cube of the third block, and so on… all takenmod 2^160. Show this does not meet at least 2 of the criteria for acryptographic hash function.
That is: hash value = (1st block + (2nd block)^2 + (3rd block)^3+ … + (mth block)^m) mod 2^160
Expert Answer
An answer will be send to you shortly. . . . .