A construction for super pseudorandom permutations from a single pseudorandom function

  • Authors:
  • Babak Sadeghiyan;Josef Pieprzyk

  • Affiliations:
  • Department of Computer Science, University College, University of New South Wales, Australian Defence Force Academy, Canberra, A.C.T., Australia;Department of Computer Science, University of Wollongong, Wollongong, N.S.W., Australia

  • Venue:
  • EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
  • Year:
  • 1992

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper, we show how to construct a super pseudorandom permutation generator from a single pseudorandom function generator, based on DES-like permutations. First, we show ψ(g, 1, f, g, 1, f), which consists of six rounds of DES-like permutations with two different pseudorandom functions and a fixed permutation, is super psuedorandom. Then, we show that with replacing a two-fold composition of one of the pseudorandom functions instead of the other one it is possible to construct a super pseudorandom permutation from a single pseudorandom function, where we need six rounds of DES-like permutations and six references to the pseudorandom function.