Author/Authors :
E. -H. Lee، نويسنده , , K. J. Kim، نويسنده , , U. J. Choi، نويسنده ,
Abstract :
In this paper, we consider one of the two open problems proposed by Pieprzyk [1], i.e., whether a permutation generator which is designed using five rounds of the Data Encryption Standard and a single pseudorandom function is a super pseudorandom permutation generator. First, we show that ψ(f,f,f2,f) is pseudorandom. Then, using the pseudorandomness of ψ(f2,f,f,f) and ψ(f,f,f2,f), we show ψ(f,f2,f,f,f) is super pseudorandom.
Keywords :
Super pseudorandom permutation generator , Pseudorandom , DES-like permutation , (D-)distinguishing circuit , Pseudorandom permutation generator
