Skip to main content
SpringerLink
Log in

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

  • Conference paper
  • First Online:
Advances in Cryptology — ASIACRYPT '91 (ASIACRYPT 1991)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 739))

Included in the following conference series:

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 ψ(f 2, f, f, f) and another circuit for ψ(f l, f k, f j, f i). Then, we investigate the necessary and sufficient conditions for super pseudorandomness of type-1 Feistel type transformations, and we show that k 2 rounds of this transformation is super pseudorandom.

Support for this project was provided in part by TELECOM Australia under the contract number 7027 and by ARC Grant under the reference number A48830241.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33(4):792–807, 1986.

    Article  Google Scholar 

  2. Michael Luby and Charles Rackoff. How to Construct Pseudorandom Permutations from Pseudorandom Functions. SIAM Journal on Computing, 17(2):373–386, 1988.

    Article  Google Scholar 

  3. Y. Ohnishi. A study on data security. Master's thesis, Tohoku University, 1988. in Japanese.

    Google Scholar 

  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. 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. 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. 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 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University College, University of New South Wales, Australian Defence Force Academy, 2600, Canberra, A.C.T., Australia

    Babak Sadeghiyan & Josef Pieprzyk

Authors
  1. Babak Sadeghiyan
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Josef Pieprzyk
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Hideki Imai Ronald L. Rivest Tsutomu Matsumoto

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Sadeghiyan, B., Pieprzyk, J. (1993). On necessary and sufficient conditions for the construction of super pseudorandom permutations. In: Imai, H., Rivest, R.L., Matsumoto, T. (eds) Advances in Cryptology — ASIACRYPT '91. ASIACRYPT 1991. Lecture Notes in Computer Science, vol 739. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-57332-1_16

Download citation

  • DOI: https://doi.org/10.1007/3-540-57332-1_16

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-57332-6

  • Online ISBN: 978-3-540-48066-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation