Pseudo-random permutation generators and cryptographic composition
Michael G. Luby, Charles Rackoff · 1986
GGM] prove that if there is a Pseudo-random number generator, then there is a pseudo-random function generator.We prove here that if there is a pseudo-random function generator, then there is a pseudo-random permutation generator.We also prove that if two permutation generators which are "slightly secure" are cryptographically composed, the result is more secure than either one alone.