Metraipolis › archive › dc_5fa5488b5ef7
Universal hashing — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Universal_hashing
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-06T00:20:42.723Z
- SHA-256 of the archived text
4d50ebbb129fb9376d0a6971471111d55085cdb9bdb8cc58f2babea747bb15e7- Stable URL of this page
https://metraipolis.com/documento/dc_5fa5488b5ef7
How to cite
Universal hashing — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Universal_hashing (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_5fa5488b5ef7 (Metraipolis archive dc_5fa5488b5ef7, sha256 4d50ebbb129fb9376d0a6971471111d55085cdb9bdb8cc58f2babea747bb15e7)
BibTeX
@misc{dc5fa5488b5ef7,
title = {Universal hashing — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Universal_hashing},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_5fa5488b5ef7; sha256 4d50ebbb129fb9376d0a6971471111d55085cdb9bdb8cc58f2babea747bb15e7},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Universal_hashing. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In mathematics and 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 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. Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; categoria «Cryptographic hash functions»). Fonte: Wikipedia in inglese, voce «Universal hashing» — https://en.wikipedia.org/wiki/Universal_hashing Wikidata Q846912: «selection of a hash function at random from a family of hash functions with a certain mathematical property, guaranteeing a low number of collisions in expectation, even if the data is chosen by an adversary» (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q846912 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Universal_hashing?action=history). Licenza: Creative Commons Attribuzione-Condividi allo stesso modo 4.0 (CC BY-SA 4.0) — https://creativecommons.org/licenses/by-sa/4.0/. Il riuso richiede attribuzione e stessa licenza. Estratto dell'introduzione non modificato nel contenuto; revisione 1375293290, consultata il 2026-10-05T23:37:19.187Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: b8de030eaca9479848e4068ecee65fb130e07d9bdc56f8a316a5c7a60f7e984e