Documents Pseudo-Random Functions 1/22 Encryption as Permutation Assume cryptosystem correct and P = C If x .....

Slide 1 Pseudo-Random Functions 1/22 Encryption as Permutation Assume cryptosystem correct and P=C If xx’ then EK(x)  EK(x’) So, no y is hit by more than one x…