A good cryptographic hashing algorithm should produce random outputs; that is, the probability of any given hash value should be approximately the same as any other for randomly chosen input data. What would be the consequence of using a hash algorithm whose outputs were not random? Consider, for example, the case where some hash values are twice as likely to occur as others.

A good cryptographic hashing algorithm should produce random outputs; that is, the probability of any given hash value should be approximately the same as any other for randomly chosen input data. What would be the consequence of using a hash algorithm whose outputs were not random? Consider, for example, the case where some hash values are twice as likely to occur as others.

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

Consider a 64-bit hash function H(x). Describe an efficient algorithm allowing you to find a pair of messages M, M0 such that H(M) = H(M0 ). Describe what resources (i.e. time and memory complexity) it would require to find such a pair
A hash table's Big-O performance is influenced by the factors listed below, listed in decreasing order of significance:
What makes a Key Derivation Function different from other families of secure hash functions (like the SHA family of algorithms) that have been investigated before? Your message will be better received if you include as much information as possible.
Is it consistent to say that a hash table of size m always contains the same number of linked lists? I've been trying to understand the purpose of a hash function for ages. Give an illustration of your point with an example.
What distinguishes a Key Derivation Function from other families of secure hash functions that have been explored in the past (such as the SHA family of algorithms)? To ensure that your message is well understood, you should include as much detail as possible.
Recall that the sponge construction describes how to turn a public random permutation into a cryptographic hash function. Once the data to be hashed has been padded, the next step is to absorb the data r bits at a time. blk = <0>while not done: xor the next r bits of data into the first r bits of blk blk = p(blk) As a convenient (but not secure because it's too small) public random permutation, lets use the AES S-box for p. What is blk after absorbing each of the following when r=4 bits. Give your answer as exactly either 2 hexadecimal digits or 8 binary digits with no spaces (eg, 0A or 00001010). Note that the data is already padded and you should restart at blk=<0> each for each computation Data: 1001 Resulting blk:____ Data 10011001 Resulting blk:_____ Data 100110011001 Resulting blk:____
1. A hash table with 10 buckets uses the hash function f(x) = x % 10, and linear probing to resolve collisions. If the keys [232, 227, 11, 106, 107] are inserted in that order into the hash table, what is the greatest number of steps a number can be from its natural position in the table?
Consider the following factors while creating an effective open hash table:
The following is a list of factors that affect the Big-O performance of a hash table, in decreasing order of significance:
Consider a hash table of size m = 100 and a corresponding hash function h(k) = [m(kA mod1)] for A = 7. Compute the √7 2 location to which the key 55 is mapped.
What makes a Key Derivation Function unique compared to other researched families of secure hash functions (like the SHA family of algorithms)? You should provide as much information as you can to ensure that your message is clearly understood.
According to the definition of a hash table, the load factor () is defined as the ratio of the number of items (n) to the number of slots (m). α=n/m Is there a relationship between the load factor and the projected amount of collisions in the simulation? In what situation does a load factor greater than one indicate?