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

Tabulation hashing, more generally known as Zobrist hashing after Albert Zobrist, is a method for constructing universal families of hash functions by...

a checksum. Hash function security summary Secure Hash Algorithms NIST hash function competition Key derivation functions (category) "Hash functions"....

universal hashing, which guarantees a low collision probability for any two designated keys. The concept of k {\displaystyle k} -independent hashing,...

on universal hashing. Intrinsically keyed hash algorithms such as SipHash are also by definition MACs; they can be even faster than universal-hashing based...

hashing by division, hashing by multiplication, universal hashing, dynamic perfect hashing, and static perfect hashing.: 2  However, hashing by division is...

In computer science, locality-sensitive hashing (LSH) is a fuzzy hashing technique that hashes similar input items into the same "buckets" with high probability...

In computer science, tabulation hashing is a method for constructing universal families of hash functions by combining table lookup with exclusive or...

cryptography, a universal hashing message authentication code, or UMAC, is a message authentication code (MAC) calculated using universal hashing, which involves...

Mittelbach, Arno; Fischlin, Marc (2021). "Non-cryptographic Hashing". The Theory of Hash Functions and Random Oracles. Cham: Springer International Publishing...

In cryptography a universal one-way hash function (UOWHF, often pronounced "woof") is a type of universal hash function of particular importance to cryptography...

Kline, Robert. "Closed Hashing". CSC241 Data Structures and Algorithms. West Chester University. Retrieved 2022-04-06. "Open hashing or separate chaining"...

Double hashing is a computer programming technique used in conjunction with open addressing in hash tables to resolve hash collisions, by using a secondary...

Static hashing is a form of hashing where lookups are performed on a finalized dictionary set (all objects in the dictionary are final and not changing)...

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

zeroes, by hashing the same input with a large number of values until a "desirable" hash was obtained. Similarly, the Bitcoin blockchain hashing algorithm...

computer science and data mining, MinHash (or the min-wise independent permutations locality sensitive hashing scheme) is a technique for quickly estimating...

frequently used for hash tables. For instance the original method of Carter and Wegman for universal hashing was based on computing hash functions by choosing...

Poly1305 is a universal hash family designed by Daniel J. Bernstein in 2002 for use in cryptography. As with any universal hash family, Poly1305 can be...

A rolling hash (also known as recursive hashing or rolling checksum) is a hash function where the input is hashed in a window that moves through the input...

Authentication Code using Universal Hashing". CFRG Working Group. IETF. Retrieved 2010-08-12. J. Carter; M. Wegman (1977). "Universal classes of hash functions (Extended...

password hashing is performed; original passwords cannot be recalculated from the stored hash value. However, use of standard cryptographic hash functions...

Zobrist hashing is the first known instance of tabulation hashing. The result is a 3-wise independent hash family. In particular, it is strongly universal. As...

Krovetz, Ted (2007-04-23). VMAC: Message Authentication Code using Universal Hashing (Report). Internet Engineering Task Force. Dai, Wei; Krovetz, Ted...

suggestions, including using Chacha20 instead of Salsa20 and using a universal hashing based MAC for performance. The outcome of this process was the adoption...

itself has. Universal hashing provides a way to authenticate messages up to an arbitrary security bound (i.e., for any p > 0, a large enough hash ensures...

Badger is a message authentication code (MAC) based on the idea of universal hashing and was developed[when?] by Boesgaard, Scavenius, Pedersen, Christensen...

hash function when integrated with all hashing schemes, i.e., producing the highest throughputs and also of good quality" whereas tabulation hashing produced...

state expandable hashing expander graph exponential extended binary tree extended Euclidean algorithm extended k-d tree extendible hashing external index...

used by the algorithm, such as the pairwise independence used in universal hashing the use of expander graphs (or dispersers in general) to amplify a...