Abstract
In this paper, we show how to construct a super pseudorandom permutation generator from a single pseudorandom function generator, based on DES-like permutations. First, we show ψ(g, 1, f, g, 1, f), which consists of six rounds of DES-like permutations with two different pseudorandom functions and a fixed permutation, is super psuedorandom. Then, we show that with replacing a two-fold composition of one of the pseudorandom functions instead of the other one it is possible to construct a super pseudorandom permutation from a single pseudorandom function, where we need six rounds of DES-like permutations and six references to the pseudorandom function.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33(4):792–807, 1986.
Michael Luby and Charles Rackoff. How to Construct Pseudorandom Permutations from Pseudorandom Functions. SIAM Journal on Computing, 17(2):373–386, 1988.
J. Pieprzyk and B. Sadeghiyan. Optimal perfect randomizers. In Abstracts of ASIACRYPT’ 91, pages 130–135, 1991.
Josef Pieprzyk. How to Construct Pseudorandom Permutations from Single Pseudorandom Functions. In Advances in Cryptology-EUROCRYPT’ 90, volume 473 of Lecture Notes in Computer Science, pages 140–150. Springer-Verlag, 1991.
B. Sadeghiyan and J. Pieprzyk. On necessary and sufficient conditions for the construction of super pseudorandom permutations. In Abstracts of ASIACRYPT’ 91, pages 117–123, 1991.
A. C. Yao. Theory and applications of trapdoor functions. In the 23rd IEEE Symposium on the Foundations of Computer Science, pages 80–91, 1982.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sadeghiyan, B., Pieprzyk, J. (1993). A Construction for Super Pseudorandom Permutations from A Single Pseudorandom Function. In: Rueppel, R.A. (eds) Advances in Cryptology — EUROCRYPT’ 92. EUROCRYPT 1992. Lecture Notes in Computer Science, vol 658. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-47555-9_23
Download citation
DOI: https://doi.org/10.1007/3-540-47555-9_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-56413-3
Online ISBN: 978-3-540-47555-2
eBook Packages: Springer Book Archive