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

numeric values is still unknown. List of hash functions Universal one-way hash function – type of universal hash function in cryptography proposed as an alternative...

computing, 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 cryptographic hash function (CHF) is a hash algorithm (a map of an arbitrary binary string to a binary string with a fixed size of n {\displaystyle...

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

information, called the trapdoor, is known. A collision-free hash function f is a one-way function that is also collision-resistant; that is, no randomized...

attacker. This non-malleability is achieved through the use of a universal one-way hash function and additional computations, resulting in a ciphertext which...

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...

to compute multiple hash functions, but a related version of MinHash scheme avoids this penalty by using only a single hash function and uses it to select...

Hash-based cryptography is the generic term for constructions of cryptographic primitives based on the security of hash functions. It is of interest as...

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...

Yung on signature based one-way permutations and functions (and the invention of universal one-way hash functions) gives a way to extend a Merkle-like...

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

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...

Computing, 17(2):281–308, Apr. 1988. Moni Naor, Moti Yung: Universal One-Way Hash Functions and their Cryptographic Applications. STOC 1989: 33–43 "Modern...

routing and universal hashing to reduce memory contention and network congestion. A finite family F {\displaystyle {\mathcal {F}}} of functions h : M → S...

org. doi:10.17487/RFC8391. Naor, Moni; Yung, Moti (1989), Universal One-Way Hash Functions and their Cryptographic Applications .STOC, pp. 33–43 Overbeck...

pseudorandomness or randomness to generate a shared key or seed, and cryptographic hash functions, which can be used to derive a value but are hard to reverse and therefore...

{\mathcal {S}}\times {\mathcal {X}}\rightarrow \{0,\,1\}^{m}} be a 2-universal hash function. If m ≤ H ∞ ( X ) − 2 log ⁡ ( 1 ε ) {\textstyle m\leq H_{\infty...

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...

received the IACR Test of Time Award for his 2009 paper See 1989: Universal one-way hash functions and their cryptographic applications (with M. Naor; ACM’s STOC)...

Lookups are performed in the same way, by searching the table sequentially starting at the position given by the hash function, until finding a cell with a...

symbol # is known variously in English-speaking regions as the number sign, hash, or pound sign (this last name is rarely found outside North America). The...

provably secure hash functions. It is based on the concept of the fast Fourier transform (FFT). SWIFFT is not the first hash function based on the FFT...

distance • Universal composability • Universal one-way hash function (UOWHF) Venona project • Verifiable secret sharing • Verisign • Very smooth hash • VEST...

a cryptographic hash function is computed, and only the resulting hash is digitally signed. Cryptographic hash functions are functions that take a variable-length...

apply. In Lua, apply can be written this way: function apply(f,...) return f(...) end In Perl, arrays, hashes and expressions are automatically "flattened"...

Hamiltonian path Hamming distance Harter–Highway dragon hash function hash heap hash table hash table delete Hausdorff distance hB-tree head heap heapify...

constructed by strengthening the ∆-universal hash family MMH using an ϵ-almost strongly universal (ASU) hash function family after the application of ENH...

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...