Pseudorandom permutation
ConceptCryptography and Computer Security
A cryptographic function resembling a random permutation
1.00Common
Common
Pseudorandom permutation
- Cryptography and Computer Security
In cryptography, a pseudorandom permutation (PRP) is a function that cannot be distinguished from a random permutation with practical effort. The random permutation is selected with uniform probability from the family of all permutations on the function's domain.
The picture on this card was made with AI. It is an illustration, not a real photo of the subject.
- Field
- Cryptography
- Defining property
- Cannot be distinguished from a random permutation with practical effort
- Random permutation
- Selected uniformly from all permutations on the domain
Sources and credits
Sources and credits
- Article
- Pseudorandom permutation (English Wikipedia)
- Wikidata
- Q7255477
- Text
- Card text is adapted from the English Wikipedia article by an automated summary. Wikipedia content is available under CC BY-SA 4.0; see the article history for its contributors. CC BY-SA 4.0 · Article history and contributors
- Illustration
- AI-generated illustration. Not a photograph or documentary image. (model: gpt-image-2.5-flare)
- Popularity
- 12 median daily views (Wikimedia Pageviews API (all-access, user agent))
Kosmora is not affiliated with or endorsed by the Wikimedia Foundation.