Abstract
The paper examines permutation generators which are designed using four rounds of the Data Encryption Standard and a single pseudorandom function. We have proved that such generators are pseudorandom only if the pseudorandom function is used internally at least five times. The proof is given using two different approaches: deterministic and probabilistic. Some cryptographic implications are also discussed.
Support for this project was provided in part by TELECOM Australia under the contract number 7027 and by the Australian Research Council under the reference number A48830241.
Chapter PDF
Similar content being viewed by others
References
M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing, 13:850–864, November 1984.
O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33(4):792–807, October 1986.
L. A. Levin. One-way function and pseudorandom generators. In Proceedings of the 17th ACM Symposium on Theory of Computing, pages 363–365, New York, 1985. ACM.
M. Luby and Ch. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal on Computing, 17(2):373–386, April 1988.
U.M. Maurer and J.L. Massey. Perfect local randomness in pseudorandom sequences. Astracts of CRYPTO’89, Santa Barbara, CA, August 1989.
R.A. Rueppel. On the security of Schnorr’s pseudo random generator. Astracts of EUROCRYPT’89, Houthalen, Belgium, April 1989.
C.P. Schnorr. On the construction of random number generators and random function generators. In Proc. of Eurocrypt 88, Lecture Notes in Computer Science, New York, 1988. Springer Verlag.
Andrew C. Yao. Theory and application of trapdoor functions. In Proceedings of the 23rd IEEE Symposium on Fundation of Computer Science, pages 80–91, New York, 1982. IEEE.
Y. Zheng, T. Matsumoto, and H. Imai. Impossibility and optimality results on constructing pseudorandom permutations. Astracts of EUROCRYPT’89, Houthalen, Belgium, April 1989.
Y. Zheng, T. Matsumoto, and H. Imai. On the construction of block ciphers provably secure and not relying on any unproved hypotheses. Astracts of CRYPTO’89, Santa Barbara, CA, July 1989.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pieprzyk, J. (1991). How to Construct Pseudorandom Permutations from Single Pseudorandom Functions. In: Damgård, I.B. (eds) Advances in Cryptology — EUROCRYPT ’90. EUROCRYPT 1990. Lecture Notes in Computer Science, vol 473. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46877-3_12
Download citation
DOI: https://doi.org/10.1007/3-540-46877-3_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53587-4
Online ISBN: 978-3-540-46877-6
eBook Packages: Springer Book Archive