Using 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 mathematical property (see definition below). This guarantees a low number of collisions in expectation, even if the data is chosen by an adversary. Many universal families are known (for hashing integers, vectors, strings), and their evaluation is often very efficient. Universal hashing has numerous uses in computer science, for example in implementations of hash tables, randomized algorithms, and cryptography.
Read more about Universal Hashing: Introduction, Mathematical Guarantees, Constructions
Famous quotes containing the word universal:
“Not so many years ago there there was no simpler or more intelligible notion than that of going on a journey. Travel—movement through space—provided the universal metaphor for change.... One of the subtle confusions—perhaps one of the secret terrors—of modern life is that we have lost this refuge. No longer do we move through space as we once did.”
—Daniel J. Boorstin (b. 1914)