Skip to search formSkip to main contentSkip to account menu

Universal hashing

Known as: Universal family, Universal hashing function, Universal hash 
In mathematics and computing universal hashing (in a randomized algorithm or data structure) refers to selecting a hash function at random from a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

28 relations

Broader (1)

Computational complexity theory
CryptographyCuckoo hashingDouble hashingDynamic perfect hashing

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
XLS is Not a Strong Pseudorandom Permutation
In FSE 2007, Ristenpart and Rogaway had described a generic method XLS to construct a length-preserving strong pseudorandom… 
2009
2009
New combinatorial bounds for universal hash functions
Using combinatorial analysis, we introduce a new lower bound for the key length in an almost universal hash function, which is… 
Highly Cited
2004
Highly Cited
2004
Secure Hashed Diffie-Hellman over Non-DDH Groups
The Diffie-Hellman (DH) transform is a basic cryptographic primitive used in innumerable cryptographic applications, most… 
2003
2003
On the Use of GF-Inversion as a Cryptographic Primitive
Inversion in Galois Fields is a famous primitive permutation for designing cryptographic algorithms e.g. for Rijndael because it… 
2001
2001
On Subgroup Separability in Hyperbolic Coxeter Groups
We prove that certain hyperbolic Coxeter groups are separable on their geometrically finite subgroups. 
2001
2001
Local Langlands Correspondences and Vanishing Cycles on Shimura Varieties
We report on the results and techniques of the author’s recent joint work with Richard Taylor, which analyzes in detail the bad… 
1999
1999
Strongly universal hashing and identification codes via channels
This article shows that /spl epsiv/-almost strongly universal classes of hash functions can yield better explicit constructions… 
1997
1997
Universal Hashing and Geometric Codes
We describe a new application of algebraic coding theory to universal hashing and authentication without secrecy. This permits to… 
1995
1995
A2 Codes from Universal Hash Classes
We describe a general method to construct codes for unconditional authentication with arbitration (A2-codes), which protect not… 
1979
1979
Canonical subgroups of formal groups
Let R be a complete local domain of mixed characteristic. This paper gives a complete answer to the question: "If F is a one… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)