How to Construct Pseudorandom and Super Pseudorandom Permutations from One Single Pseudorandom Function
We will see that it is possible to obtain a pseudorandom permutation generator with only three rounds of DES - like permutation and a single pseudorandom function. This will solve an open problem of .
We will see that it is possible to obtain a super pseudorandom permutation generator with a single pseudorandom function. This will solve an open problem of . For this we will use only four rounds of DES — like permutation.
For example, we will see that if ζ denotes the rotation of one bit, ψ(f, f, f o ζ o f) is a pseudorandom function generator. And ψ(f, f, f, f o ζ o f) is a super pseudorandom function generator.
Here the number of rounds used is optimal. It should be noted that here we introduce an important new idea in that we do not use a composition of f, i times, but f o ζ o f for the last round, where ζ is a fixed and public function.
- J. Patarin, New results on pseudorandom permutation generators based on the DES Scheme, Abstracts of Crypto’91, p. 7–2, 7–7.Google Scholar
- J. Patarin, Etude des générateurs de permutations basés sut le schéma du DES, Thèse, November 1991, INRIA, Domaine de Voluceau, Le Chesnay, France.Google Scholar
- J. Pieprzyk, How to construct pseudorandom permutations from Single Pseudorandom Functions, EUROCRYPT’90, Århus, Denmark, May 1990.Google Scholar
- B. Sadeghiyan and J. Pieprzyk, On necessary and sufficient conditions for the construction of super pseudorandom permutations, Abstracts of Asiacrypt’91, November 1991, p. 117–123.Google Scholar
- Y. Zheng, T. Matsumoto and H. Imai, Impossibility and optimality results on constructing pseudorandom permutations, Abstract of EUROCRYPT’89, Houthalen, Belgium, April 1989, p. 412–421.Google Scholar