Advertisement

How to Construct Pseudorandom Permutations from Single Pseudorandom Functions

Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 473)

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.

References

  1. [1]
    M. Blum and S. Micali. How to generate cryptographically strong sequences of pseudo-random bits. SIAM Journal on Computing, 13:850–864, November 1984.MathSciNetzbMATHCrossRefGoogle Scholar
  2. [2]
    O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33(4):792–807, October 1986.MathSciNetCrossRefGoogle Scholar
  3. [3]
    L. A. Levin. One-way function and pseudorandom generators. In Proceedings of the 17th ACM Symposium on Theory of Computing, pages 363–365, New York, 1985. ACM.Google Scholar
  4. [4]
    M. Luby and Ch. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal on Computing, 17(2):373–386, April 1988.MathSciNetzbMATHCrossRefGoogle Scholar
  5. [5]
    U.M. Maurer and J.L. Massey. Perfect local randomness in pseudorandom sequences. Astracts of CRYPTO’89, Santa Barbara, CA, August 1989.Google Scholar
  6. [6]
    R.A. Rueppel. On the security of Schnorr’s pseudo random generator. Astracts of EUROCRYPT’89, Houthalen, Belgium, April 1989.Google Scholar
  7. [7]
    C.P. Schnorr. On the construction of random number generators and random function generators. In Proc. of Eurocrypt 88, Lecture Notes in Computer Science, New York, 1988. Springer Verlag.Google Scholar
  8. [8]
    Andrew C. Yao. Theory and application of trapdoor functions. In Proceedings of the 23rd IEEE Symposium on Fundation of Computer Science, pages 80–91, New York, 1982. IEEE.Google Scholar
  9. [9]
    Y. Zheng, T. Matsumoto, and H. Imai. Impossibility and optimality results on constructing pseudorandom permutations. Astracts of EUROCRYPT’89, Houthalen, Belgium, April 1989.Google Scholar
  10. [10]
    Y. Zheng, T. Matsumoto, and H. Imai. On the construction of block ciphers provably secure and not relying on any unproved hypotheses. Astracts of CRYPTO’89, Santa Barbara, CA, July 1989.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  1. 1.Department of Computer Science University College University of New South WalesAustarlian Defence Force AcademyCanberraAustralia

Personalised recommendations