Advertisement

On necessary and sufficient conditions for the construction of super pseudorandom permutations

  • Babak Sadeghiyan
  • Josef Pieprzyk
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 739)

Abstract

In this paper, we present the necessary and sufficient conditions for super pseudorandomness of DES-like permutations. We show that four rounds of such permutations with a single random function is not super psuedorandom and we present a distinguishing circuit for ψ(f2, f, f, f) and another circuit for ψ(f l , fk, fj, fi). Then, we investigate the necessary and sufficient conditions for super pseudorandomness of type-1 Feistel type transformations, and we show that k2 rounds of this transformation is super pseudorandom.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33(4):792–807, 1986.CrossRefGoogle Scholar
  2. [2]
    Michael Luby and Charles Rackoff. How to Construct Pseudorandom Permutations from Pseudorandom Functions. SIAM Journal on Computing, 17(2):373–386, 1988.CrossRefGoogle Scholar
  3. [3]
    Y. Ohnishi. A study on data security. Master's thesis, Tohoku University, 1988. in Japanese.Google Scholar
  4. [4]
    Josef Pieprzyk. How to Construct Pseudorandom Permutations from Single Pseudorandom Functions. In Advances in Cryptology — EUROCRYPT '90, volume 473 of Lecture Notes in Computer Science, pages 140–150. Springer-Verlag, 1991.Google Scholar
  5. [5]
    A. C. Yao. Theory and applications of trapdoor functions. In the 23rd IEEE Symposium on the Foundations of Computer Science, pages 80–91, 1982.Google Scholar
  6. [6]
    Yuliang Zheng, Tsumoto Matsumoto, and Hideki Imai. Impossibility and Optimality Results on Constructing Pseudorandom Permutations. In Advances in Cryptology — EUROCRYPT '89, volume 434 of Lecture Notes in Computer Science, pages 412–422. Springer-Verlag, 1990.Google Scholar
  7. [7]
    Yuliang Zheng, Tsumoto Matsumoto, and Hideki Imai. On the Construction of Block Ciphers Provably Secure and Not Relying on any Unproved Hypotheses. In Advances in Cryptology — CRYPTO '89, volume 435 of Lecture Notes in Computer Science, pages 461–480. Springer-Verlag, 1990.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Babak Sadeghiyan
    • 1
  • Josef Pieprzyk
    • 1
  1. 1.Department of Computer Science, University CollegeUniversity of New South Wales, Australian Defence Force AcademyCanberraAustralia

Personalised recommendations