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:
“The universal regard for money is the one hopeful fact in our civilisation. Money is the most important thing in the world. It represents health, strength, honour, generosity and beauty.... Not the least of its virtues is that it destroys base people as certainly as it fortifies and dignifies noble people.”
—George Bernard Shaw (1856–1950)