Introduction to Algorithms
Introduction to Algorithms
3rd Edition
ISBN: 9780262033848
Author: Thomas H. Cormen, Ronald L. Rivest, Charles E. Leiserson, Clifford Stein
Publisher: MIT Press
bartleby

Concept explainers

Question
Book Icon
Chapter 11, Problem 4P

(a)

Program Plan Intro

To identify whether family H of hash function is universal if it’s 2-Universal.

(b)

Program Plan Intro

To show that family H of hash function is universal but not 2-Universal.

(c)

Program Plan Intro

To determine that modified family H’ of hash function from family H is 2-Universal class.

(d)

Program Plan Intro

Find the probability of advisory succeeds in bob’s fooling in to accepting is at most 1/m where m is the message sent by Alice.

Blurred answer
Students have asked these similar questions
Prove the theorem Suppose that a hash function h is chosen randomly from a universal collection of hash functions and has been used to hash n keys into a table T of size m, using chaining to resolve collisions. If key k is not in the table, then the expected length E Œnh.k/ of the list that key k hashes to is at most the load factor ˛ D n=m. If key k is in the table, then the expected length E Œnh.k/ of the list containing key k is at most 1 C ˛.
Given a known set of keys, a perfect hash function is one that translates every key to adifferent bucket index. For example, given the set of keys {'alpha', 'beta', 'gamma', 'delta’},the following is a perfect hash function:m = 4; hash(k) = (initial letter of k - 'a') modulo 4a. Under what circumstances does it make sense to seek a perfect hash function? Explain.b. How can a perfect hash function be exploited in implementing a hash table? Explain.c. Given the following set of keys:{CA, MX, US}find a perfect hash function with m = 3,d. Given the following set of keys:{AT, BE, DE, DK, ES, FI, FR, GR, IE, IT, LU, NL, PT, SE, UK}find a perfect hash function with m < 20.
Computer Science (a) Let h be a collision resistant hash function. Now consider the following function H that is defined for binary strings of even length. Let x = x1||x2 with x1 ∈ F2n and x2 ∈ Fn2 . Then H(x) = h(x1 ⊕ x2). Prove that this function is not collision resistant.
Knowledge Booster
Background pattern image
Computer Science
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Similar questions
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education