Optimal perfect randomizers

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


The work examines a class of randomizers built using concatenation of several layers of Luby-Rackoff elementary randomizers. First we examine some properties of Luby and Rackoff randomizers. Next we discuss the quality of randomizers with the concatenation of several Luby-Rackoff randomizers. Finally, the main result of the work is presented which proves that the concatenation of two layers of modified L-R randomizers is a perfect randomizer.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    O. Goldreich, S. Goldwasser, and S. Micali. How to construct random functions. Journal of the ACM, 33(4):792–807, October 1986.CrossRefGoogle Scholar
  2. [2]
    M. Luby and Ch. Rackoff. How to construct pseudorandom permutations from pseudorandom functions. SIAM Journal on Computing, 17(2):373–386, April 1988.CrossRefGoogle Scholar
  3. [3]
    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

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

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

Personalised recommendations