Abstract
We present in a new way the results of Michael Luby and Charles Rackoff “How to construct pseudorandom permutations from pseudorandom functions”, SIAM J. Comput., 1988, together with some new results thereon.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
M. LUBY, C. RACKOFF How to construct pseudorandom permutations from pseudorandom functions SIAM J. Compt, 1988.
J. PIERPRZYK How to construct pseudorandom permutations from single pseudorandom Functions, Abstract of Eurocrypt 90.
Y. ZHENG, T. MATSUMOKO, H. IMAI, Impossibility and optimality results on constructing pseudorandom permutations, Abstract of Eurocrypt 89.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1991 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Patarin, J. (1991). Pseudorandom permutations based on the D.E.S. scheme. In: Cohen, G., Charpin, P. (eds) EUROCODE '90. EUROCODE 1990. Lecture Notes in Computer Science, vol 514. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54303-1_131
Download citation
DOI: https://doi.org/10.1007/3-540-54303-1_131
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-54303-9
Online ISBN: 978-3-540-47546-0
eBook Packages: Springer Book Archive