How to construct pseudorandom permutations from single pseudorandom functions

32Citations
Citations of this article
43Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Pieprzyk, J. (1991). How to construct pseudorandom permutations from single pseudorandom functions. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 473 LNCS, pp. 140–150). Springer Verlag. https://doi.org/10.1007/3-540-46877-3_12

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free