Consider a version of the division method in which h(k) = k mod m, where m = 2P-1 and k is a character string interpreted in radix 2P. Show that if we can derive string x from string y by permuting its characters, then x and y hash to the same value. Give an example of an application in which this property would be undesirable in a hash function. CHAINED-HASH-INSERT (T, x) 1 insert x at the head of list T[h(x.key)] CHAINED-HASH-SEARCH (T, k) 1 search for an element with key k in list T[h(k)] CHAINED-HASH-DELETE (T, x) 1 delete x from the list T[h(x.key)]
Consider a version of the division method in which h(k) = k mod m, where m = 2P-1 and k is a character string interpreted in radix 2P. Show that if we can derive string x from string y by permuting its characters, then x and y hash to the same value. Give an example of an application in which this property would be undesirable in a hash function. CHAINED-HASH-INSERT (T, x) 1 insert x at the head of list T[h(x.key)] CHAINED-HASH-SEARCH (T, k) 1 search for an element with key k in list T[h(k)] CHAINED-HASH-DELETE (T, x) 1 delete x from the list T[h(x.key)]
Related questions
Question
I need help with this please

Transcribed Image Text:Consider a version of the division method in which h(k) = k mod m, where
m = 2P-1 and k is a character string interpreted in radix 2P. Show that if we
can derive string x from string y by permuting its characters, then x and y hash to
the same value. Give an example of an application in which this property would be
undesirable in a hash function.
![CHAINED-HASH-INSERT (T, x)
1 insert x at the head of list T[h(x.key)]
CHAINED-HASH-SEARCH (T, k)
1 search for an element with key k in list T[h(k)]
CHAINED-HASH-DELETE (T, x)
1 delete x from the list T[h(x.key)]](/v2/_next/image?url=https%3A%2F%2Fcontent.bartleby.com%2Fqna-images%2Fquestion%2F90f58de2-50da-4b6e-9c57-43880988af50%2F29e4c4b8-4e1a-40bc-ab58-717edbbde122%2Fcjbx3_processed.png&w=3840&q=75)
Transcribed Image Text:CHAINED-HASH-INSERT (T, x)
1 insert x at the head of list T[h(x.key)]
CHAINED-HASH-SEARCH (T, k)
1 search for an element with key k in list T[h(k)]
CHAINED-HASH-DELETE (T, x)
1 delete x from the list T[h(x.key)]
Expert Solution

This question has been solved!
Explore an expertly crafted, step-by-step solution for a thorough understanding of key concepts.
Step by step
Solved in 2 steps with 1 images
