论文信息 - New Results on Pseudorandom Permutation Generators Based on the DES Scheme

New Results on Pseudorandom Permutation Generators Based on the DES Scheme

We denote by ?k the permutation generator based on the DES Scheme with k rounds where the S boxes are replaced by random independant functions. We denote by |P1 - P1*|, (respectively |P1 - P1**|), the probability of distinguishing such a permutation from a random function (respectively from a random permutation) by means of a distinguishing circuit that has m oracle gates.

Jacques Patarin | J. Patarin

[1] Jacques Patarin. Pseudorandom Permutations Based on the D.E.S. Scheme , 1990, ESORICS.

[2] Josef Pieprzyk,et al. How to Construct Pseudorandom Permutations from Single Pseudorandom Functions , 1991, EUROCRYPT.

[3] Michael Luby,et al. How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract) , 1986, CRYPTO.

[4] Hideki Imai,et al. Impossibility and Optimality Results on Constructing Pseudorandom Permutations (Extended Abstract) , 1989, EUROCRYPT.