In computer science, a perfect hash function h for a set S is a hash function that maps distinct elements in S to a set of m integers, with no collisions...

Universal hashing – Technique for selecting hash functions Perfect hash function – Hash function without any collisions Injective map – Function that preserves...

output. The values returned by a hash function are called hash values, hash codes, (hash/message) digests, or simply hashes. The values are usually used to...

data type that maps keys to values. A hash table uses a hash function to compute an index, also called a hash code, into an array of buckets or slots...

dynamic perfect hashing is a programming technique for resolving collisions in a hash table data structure. While more memory-intensive than its hash table...

universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a family of hash functions with a certain...

adjusted so that those inputs yield distinct hash values, producing what is called a perfect hash function. Two input strings differing by exactly one...

perfect hash function, and can be implemented using as few as O ( m log ⁡ log ⁡ log ⁡ n ) {\displaystyle O(m\log \log \log n)} bits. A succinct hash table...

the perfect hash function. Using a minimum perfect hash function gives a big space improvement if the associated values are relatively small. Hashed filters...

squares (~bits in the corresponding hash function). As with other schemes which require a perfect hashing function, an exhaustive process of enumeration...

non-cryptographic hash functions (NCHFs) are hash functions intended for applications that do not need the rigorous security requirements of the cryptographic hash functions...

be built from any cryptographically secure one-way function; usually a cryptographic hash function is used. Although the potential development of quantum...

Cuckoo hashing is a scheme in computer programming for resolving hash collisions of values of hash functions in a table, with worst-case constant lookup...

alternative rock band from Auckland, New Zealand Perfect hash function, a set of hash functions which generate no collisions. Potentially Hazardous Food...

2 n {\displaystyle 2n} . Hash function Dynamic perfect hashing Daniel Roche (2013). SI486D: Randomness in Computing, Hashing Unit. United States Naval...

used for: dynamic perfect hashing; even if the adversary can change the key-distribution depending on the values the hashing function has assigned to the...

to cryptographic hash functions, which are designed to have significantly different hashes for even minor differences. Fuzzy hashing has been used to...

that a hypothetical hashing function will evenly distribute items into the slots of a hash table. Moreover, each item to be hashed has an equal probability...

their nesting GNU Fontutils – font management utilities GNU gperf – perfect hash function generator GNU indent – program to indent C and C++ source code GNU...

duplicates of a relatively small number of items, a constant-time perfect hash function can greatly speed up finding where to put an item1, turning the...

system can be linked against it as well. During the chroot phase, bash's hashing feature is turned off and the temporary toolchain's bin directory moved...

values of a hash function, with H = 2 l {\textstyle H=2^{l}} . With a birthday attack, it is possible to find a collision of a hash function with 50 % {\textstyle...

computer science, a family of hash functions is said to be k-independent, k-wise independent or k-universal if selecting a function at random from the family...

A distributed hash table (DHT) is a distributed system that provides a lookup service similar to a hash table. Key–value pairs are stored in a DHT, and...

occupancy bits in the masked portion. One such scheme that uses a perfect hash function along with tricks to minimize the potential size of the table that...

different bit-fields of such a hash, so this type of hash can be used to generate multiple "different" hash functions by slicing its output into multiple...

|S|=k} , there exists a hash function h in F such that h : S → {1, ..., k} is perfect. In other words, there must exist a hash function in F that colors any...

Cycle Merkle tree–based Guided tour puzzle protocol partial match od a hash function[citation needed] At the IACR conference Crypto 2022 researchers presented...

Hopscotch hashing is a scheme in computer programming for resolving hash collisions of values of hash functions in a table using open addressing. It is...

for 32-bit ctz uses de Bruijn sequences to construct a minimal perfect hash function that eliminates all branches. This algorithm assumes that the result...