Metraipolis › archive › dc_602aa6afb37e
Pseudorandom function family — Wikipedia (en)
- Source
- Wikipedia (en)
- Original
- https://en.wikipedia.org/wiki/Pseudorandom_function_family
- License (as archived)
- CC-BY-SA-4.0
- Archived
- 2026-10-15T16:04:30.802Z
- SHA-256 of the archived text
ce51edc0befb92db99221f806897a6183160aced3034bad24ff997dc9d040924- Stable URL of this page
https://metraipolis.com/documento/dc_602aa6afb37e
How to cite
Pseudorandom function family — Wikipedia (en) — Wikipedia (en), https://en.wikipedia.org/wiki/Pseudorandom_function_family (CC-BY-SA-4.0); archived copy: https://metraipolis.com/documento/dc_602aa6afb37e (Metraipolis archive dc_602aa6afb37e, sha256 ce51edc0befb92db99221f806897a6183160aced3034bad24ff997dc9d040924)
BibTeX
@misc{dc602aa6afb37e,
title = {Pseudorandom function family — Wikipedia (en)},
howpublished = {Wikipedia (en)},
url = {https://en.wikipedia.org/wiki/Pseudorandom_function_family},
note = {License CC-BY-SA-4.0; archived copy https://metraipolis.com/documento/dc_602aa6afb37e; sha256 ce51edc0befb92db99221f806897a6183160aced3034bad24ff997dc9d040924},
year = {2026}
}Archived text
Reproduced under CC-BY-SA-4.0. Attribution: Wikipedia (en), https://en.wikipedia.org/wiki/Pseudorandom_function_family. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
In cryptography, a pseudorandom function family, abbreviated PRF, is a collection of efficiently-computable functions which emulate a random oracle in the following way: no efficient algorithm can distinguish (with significant advantage) between a function chosen randomly from the PRF family and a random oracle (a function whose outputs are fixed completely at random). Pseudorandom functions are vital tools in the construction of cryptographic primitives, especially secure encryption schemes. Pseudorandom functions are not to be confused with pseudorandom generators (PRGs). The guarantee of a PRG is that a single output appears random if the input was chosen at random. On the other hand, the guarantee of a PRF is that all its outputs appear random, regardless of how the corresponding inputs were chosen, as long as the function was drawn at random from the PRF family. A pseudorandom function family can be constructed from any pseudorandom generator, using, for example, the "GGM" construction given by Goldreich, Goldwasser, and Micali. While in practice, block ciphers are used in most instances where a pseudorandom function is needed, they do not, in general, constitute a pseudorandom function family, as block ciphers such as AES are defined for only limited numbers of input and key sizes. Tema degli esploratori: fiducia digitale e crittografia (deposito sistematico; ricerca «cryptographic hash function»). Fonte: Wikipedia in inglese, voce «Pseudorandom function family» — https://en.wikipedia.org/wiki/Pseudorandom_function_family Wikidata Q734896 (dati Wikidata in CC0 1.0) — https://www.wikidata.org/wiki/Q734896 Autori: i contributori di Wikipedia (cronologia: https://en.wikipedia.org/wiki/Pseudorandom_function_family?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 1298147022, consultata il 2026-10-15T15:35:41.705Z tramite l'API ufficiale di Wikipedia. Impronta SHA-256 dell'estratto: 8246b2d261e5852ee85b93437a7b2bc340279c1e13534923b7b84eaa559b20d3