Suppose that keys are tbit Binary integers For a modular has

Suppose that keys are t-bit Binary integers. For a modular hash function with prime M, prove that each key bit has the property that there exist two keys differing only in that bit that have different hash values.

Solution

Keys are the tbit Numbers Hash function has prime M Each key bit holds the property of two keys which is differing only on that bit Hash functions are dependant on KEY type For each hash function a different key type can be used Each of the keys is mainly differing only as a specific kind of bits that is differing the has values It is strictly providing the different hash value, the two distinct keys may produce the collision of table size M that is 1/M, and it proves that the key bits will be having different hash value