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:
“Of lower states, of acts of routine and sense, we can tell somewhat; but the masterpieces of God, the total growths and universal movements of the soul, he hideth; they are incalculable. I can know that truth is divine and helpful; but how it shall help me I can have no guess, for so to be is the sole inlet of so to know.”
—Ralph Waldo Emerson (1803–1882)