Advertisement

Pseudorandom permutations based on the D.E.S. scheme

  • Jacques Patarin
Section 4 Protection Of Information
Part of the Lecture Notes in Computer Science book series (LNCS, volume 514)

Abstract

We present in a new way the results of Michael Luby and Charles Rackoff “How to construct pseudorandom permutations from pseudorandom functions”, SIAM J. Comput., 1988, together with some new results thereon.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    M. LUBY, C. RACKOFF How to construct pseudorandom permutations from pseudorandom functions SIAM J. Compt, 1988.Google Scholar
  2. [2]
    J. PIERPRZYK How to construct pseudorandom permutations from single pseudorandom Functions, Abstract of Eurocrypt 90.Google Scholar
  3. [3]
    Y. ZHENG, T. MATSUMOKO, H. IMAI, Impossibility and optimality results on constructing pseudorandom permutations, Abstract of Eurocrypt 89.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Jacques Patarin
    • 1
  1. 1.INRIA Domaine de VoluceauLe Chesnay CedexFrance

Personalised recommendations