Consider a Bloom Filter scheme to prevent users from choosing passwords from a dictionary.For this problem, assume that your system can hold a Bloom Filter of length 220 (i.e., 2^20) whileconsidering storage. For this problem, what is the optimal number of hash functions you need to use?Give an approximate number. Roughly speaking, these many hash funcJons will assure you that theFalse Positive Rate of around 1%. Assume number of words in a dictionary is around 100,000. Showyour work.
Consider a Bloom Filter scheme to prevent users from choosing passwords from a dictionary.For this problem, assume that your system can hold a Bloom Filter of length 220 (i.e., 2^20) whileconsidering storage. For this problem, what is the optimal number of hash functions you need to use?Give an approximate number. Roughly speaking, these many hash funcJons will assure you that theFalse Positive Rate of around 1%. Assume number of words in a dictionary is around 100,000. Showyour work.
Related questions
Question
Consider a Bloom Filter scheme to prevent users from choosing passwords from a dictionary.
For this problem, assume that your system can hold a Bloom Filter of length 220 (i.e., 2^20) while
considering storage. For this problem, what is the optimal number of hash functions you need to use?
Give an approximate number. Roughly speaking, these many hash funcJons will assure you that the
False Positive Rate of around 1%. Assume number of words in a dictionary is around 100,000. Show
your work.
AI-Generated Solution
AI-generated content may present inaccurate or offensive content that does not represent bartleby’s views.
Unlock instant AI solutions
Tap the button
to generate a solution