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.
CITATION STYLE
Maurer, U. M. (1993). A simplified and generalized treatment of luby-rackoff pseudorandom permutation generators. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 658 LNCS, pp. 239–255). Springer Verlag. https://doi.org/10.1007/3-540-47555-9_21
Mendeley helps you to discover research relevant for your work.