flâneur

Pseudorandom permutation

en.wikipedia.org · 1,597 words · saved by 1 readers

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.

Pseudorandom permutation - Wikipedia Jump to content From Wikipedia, the free encyclopedia Class of functions in cryptography 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 [ edit ] 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}} . F is a PRP if and

related reading