Quote: a hash function should avoid funneling, i.e., the map of a set of input bits to a smaller set of output bits

Quotation Skeleton

If a hash allows small sets of input … keys will map to the same handful of … [p. 108] Any time n input bits can only … can only produce 2^m distinct has values. The … … I call this problem "funneling." … [p. 109] There is an efficient test to detect … the fastest such function I could find. … [p. 115] mix 3 32-bit values reversibly … mix() takes 36 machine instructions, but only 18 … that's the result of my brute-force search … [I] tested about a billion of [the 2^68 possible hash functions.]   Google-1   Google-2

Copyright clearance needed for quotation.

Additional Titles

Quote: the fastest code for a hash function to mix three 32-bit values reversibly

Related Topics

Topic: hash table and hash functions (41 items)