Pseudorandom permutation

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.

This keyword could refer to multiple things. Here are some suggestions: