Pseudorandom permutation

From CRYPTUTOR

A pseudorandom permutation (PRP) is a pseudorandom function $F$ which is also a permutation. That is, for every seed $s$ and every $n$ , $F_s\,$ is a permutation when restricted to $n$ -bit strings.

A strong pseudorandom permutation is a pseudorandom permutation whose security holds even when we let the adversary have oracle access to the pseudorandom permutation's inverse.

Both strong and standard PRPs can be constructed from any pseudorandom function using the Luby-Rackoff construction.

Retrieved from "http://crypto.cs.uiuc.edu/wiki/index.php/Pseudorandom_permutation"

Category: Cryptographic constructs