11.3 a. Consider the following hash function. Messages are in the form of a sequence of numbers in Zn, M = (a1, a2,cat). The hash value h is calculated as for some predefined value n. Does this hash function satisfy any of the requirements for a hash function listed in Table 11.1? Explain your answer. b. Repeat part ( a) for the hash function mod n. c. Calculate the hash function of part ( b) for M = (189, 632, 900, 722, 349) and n = 989. | |
| View Solution | |
| << Back | Next >> |