In cryptography, a pseudorandom permutation (PRP) is a function that cannot be distinguished from a random permutation (that is, a permutation selected at random with uniform probability, from the family of all permutations on the function's domain) with practical effort. == Definition == Let F be a mapping { 0 , 1 } n × { 0 , 1 } s → { 0 , 1 } n {\displaystyle \left\{0,1\right\}^{n}\times \left\{0,1\right\}^{s}\rightarrow \left\{0,1\right\}^{n}} .
In cryptography, a pseudorandom permutation (PRP) is a function that cannot be distinguished from a random permutation (that is, a permutation selected at random with uniform probability, from the family of all permutations on the function's domain) with practical effort. == Definition == Let F be a mapping { 0 , 1 } n × { 0 , 1 } s → { 0 , 1 } n {\displaystyle \left\{0,1\right\}^{n}\times \left\{0,1\right\}^{s}\rightarrow \left\{0,1\right\}^{n}} .
Source: Wikipedia "Pseudorandom permutation" · CC BY-SA 4.0
Share this article: X · Bluesky