Advertisement

Journal of Cryptology

, Volume 12, Issue 1, pp 29–66 | Cite as

On the Construction of Pseudorandom Permutations: Luby—Rackoff Revisited

  • Moni Naor
  • Omer Reingold
Article

Abstract.

Luby and Rackoff [26] showed a method for constructing a pseudorandom permutation from a pseudorandom function. The method is based on composing four (or three for weakened security) so-called Feistel permutations, each of which requires the evaluation of a pseudorandom function. We reduce somewhat the complexity of the construction and simplify its proof of security by showing that two Feistel permutations are sufficient together with initial and final pairwise independent permutations. The revised construction and proof provide a framework in which similar constructions may be brought up and their security can be easily proved. We demonstrate this by presenting some additional adjustments of the construction that achieve the following:

• Reduce the success probability of the adversary.

• Provide a construction of pseudorandom permutations with large input-length using pseudorandom functions with small input-length.

Key words. Pseudorandomness, Block ciphers, Modes of operation. 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© International Association for Criptologic Research 1999

Authors and Affiliations

  • Moni Naor
    • 1
  • Omer Reingold
    • 1
  1. 1.Department of Applied Mathematics and Computer Science, Weizmann Institute of Science, Rehovot 76100, Israel naor@wisdom.weizmann.ac.il, reingold@wisdom.weizmann.ac.ilIL

Personalised recommendations