A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generator

A paper by Luby and Rackoff on the construction of pseudorandom permutations from pseudorandom functions based on a design principle of the DES has recently initiated a burst of research activities on applications and generalizations of these results. This paper presents a strongly simplified treatment of these results and generalizes them by pointing out the relation to locally random functions, thereby providing new insight into the relation between probability-theoretic and complexity-theoretic results in cryptography. The first asymptotically-optimal construction of a locally random function is presented and new design strategies for block ciphers based on these results are proposed.

[1]  Michael Luby,et al.  How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract) , 1986, CRYPTO.

[2]  H. O. Lancaster.  Pairwise Statistical Independence , 1965 .

[3]  Claus-Peter Schnorr,et al.  On the Construction of Random Number Generators and Random Function Generators , 1988, EUROCRYPT.

[4]  Hideki Imai,et al.  Impossibility and Optimality Results on Constructing Pseudorandom Permutations (Extended Abstract) , 1989, EUROCRYPT.

[5]  Leonid A. Levin,et al.  One-way functions and pseudorandom generators , 1985, STOC '85.

[6]  A. Joffe.  On a Set of Almost Deterministic $k$-Independent Random Variables , 1974 .

[7]  John Gill,et al.  Relative to a Random Oracle A, PA != NPA != co-NPA with Probability 1 , 1981, SIAM J. Comput..

[8]  Dorothy E. Denning,et al.  Cryptography and Data Security , 1982 .

[9]  Jacques Patarin,et al.  New Results on Pseudorandom Permutation Generators Based on the DES Scheme , 1991, CRYPTO.

[10]  Oded Goldreich,et al.  On the power of two-point based sampling , 1989, J. Complex..

[11]  Noga Alon,et al.  Simple construction of almost k-wise independent random variables , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[12]  Manuel Blum,et al.  How to generate cryptographically strong sequences of pseudo random bits , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[13]  Silvio Micali,et al.  How to construct random functions , 1986, JACM.

[14]  Josef Pieprzyk,et al.  How to Construct Pseudorandom Permutations from Single Pseudorandom Functions , 1991, EUROCRYPT.