Suppose you want to prevent an attacker from finding a collision in a hash function. The attacker has enough computing power to calculate 240 hash values. You need to ensure that the attacker has only small chance of success but prefer the smallest acceptable output size. You have three possible output sizes to choose from. Which should you choose?

Suppose you want to prevent an attacker from finding a collision in a hash function. The attacker has enough computing power to calculate 240 hash values. You need to ensure that the attacker has only small chance of success but prefer the smallest acceptable output size. You have three possible output sizes to choose from. Which should you choose?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

A well designed hash function normally has multiple properties, including collision resistance, which means it is very hard for one to find a pair of inputs x≠y, such that h(x) = h(y). Could we just use a collision resistant function to do encryption? i.e., Enc(k,m)=f(k,m), where f is a collision resistant function.
What is a “brute-force” attack on a hash function? Describe two types of brute-force attacks Suppose H(m) is a collision-resistant hash function that maps a message of arbitrary bit length into an n-bit hash value. Is it true that, for all messages x, x’ with x ≠ x’, we have H(x) ≠ H(x’)? Explain your answer
Implement a dynamically resizable hash table to store people’s names and Social Security numbers. Use the extraction method with division using the last four digits of the Social Security number. Use an initial table size of 31 and a load factor of 0.80. Use open addressing with double hashing using an extraction method on the first three digits of the Social Security number.
Consider a hash function h(x) = x mod 2256, that is, the hash function returnsthe last 256 bits of x.Does this function havea. collision resistanceb. irreversibilityc. puzzle friendlinessWhy or why not?
Given input {4371, 1323, 6173, 4199, 4344, 9679, 1989} and a hash function h(x) = x mod 10, show the resulting open addressing hash table: (ii) with second hash function h2(x) = 7 – (x mod 7). Please show me the steps
A. We have decided to change the type of hashing we use to a newer version that is collision resistant. What happens when a hash collision occurs? You can figure out the plain text from the hash. When two different plaintexts produce the same hash. The same plain text produces two different hashes using the same hash function. A variable-length text produces a fixed-length hash. B.“Alice” and “Bob” are talking about hashing and they use the abbreviation MAC. What are they talking about? Message Authentication Code. Media Access Control. Mandatory Access Control. Message Access Code. C.Which one of the following is not one of the basic requirements for a cryptographic hash function? The function must be collision free. The function must work on fixed-length input. The function must be relatively easy to compute for any input. The function must be one way. D.Bob wants to produce a message digest of a 2,048-byte message he plans to send to Alice. If he uses the SHA-1 hashing…
Suppose Alice computes the Secret suffix MAC (page 322: secret suffix MAC(x) = h(x || key)) for the message ”GD” (in ASCII) with key " H”(in ASCII) that both Alice and Bob know. The hash function that is used is h(x1x2x3)= g(g(x1 XOR x2) XOR x3 ) where each xi is a character represented as 8 bits, and g(x) is a 8-bit string that is equal to the complement of bits in x. For example, g(10110011) = 01001100. The MAC is 8 bits. (8-bit ASCII representation of the characters is given below.) What is the Secret suffix MAC computed by Alice? Show the MAC as the single character. What information is sent by Alice to Bob.
Suppose a hash table has 11 locations, keys are placed in the table using the hash function f (x) = x mod 11, and linear chaining is used to resolve collisions Draw a picture of the result of storing the following keys in the table: 0, 12, 42, 18, 6, 22, 8, 105, 97
Think about a hash table using open addressing. If there are N elements and the load factor should not go above 75%, what should the table size, S, be? Here you are not using a specific number for N, therefore you won't use my prime number table. Express your answer in the following format. Don't use any space. If you need to use greater/less than or equal to something, type >= or <=. S?
Suppose you are given the following set of keys to insert into a hash table that holds exactly 11 values: 113, 117, 97, 100, 114, 108, 116, 105, 99. Using the hash function= value %table_size. Which of the following best demonstrates the contents of the hash table after all the keys have been inserted using linear probing? a) 100,__,__,113,114,105,116,117,97,108,99 b) 99,100,__,113,114,__,116,117,105,97,108 c) 100,113,117,97,14,108,116,105,99,__,__ d) 117,114,108,116,105,99,__,__,97,100,113
A hash code is generated by the Java hash function for Strings based on a string's highest allowed character count. Explain how a powerful, constant-time hashing algorithm can be created given that Strings have no useful maximum length. Which eight characters, say, would you select to represent a string of length l if you had to?
This question relates to hash functions for block ciphers Block size = 4 bits Hash size = 4 bits Encryption function: Divide the key into two halves: LK and RK; Divide the plaintext into two halves: LT and RT; Then ciphertext= LC||RC where LC=LK XOR RT; and RC = RK XOR LT; where LC, RC, LT, and RT are each 2 bits; Plaintext and ciphertext are each 4 bits. g(H) = a 4-bit string that is equal to the complement of bits in H; For example, if H=A (Hexa) = 1010 (binary); then g(H)= 0101 H0 = Initial hash = C (in Hexa) Given message M: D9 (in Hexa); a. Determine the hash (in hexadecimal) of the message M using Martyas-Meyer-Oseas hash function b. Determine the hash (in hexadecimal) of the message M using Davis-Meyer hash function c. Determine the hash (in hexadecimal) of the message M using Migayuchi-Preneel hash function