How to construct random functions
Journal of the ACM (JACM)
How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
How to construct pseudorandom permutations from single pseudorandom functions
EUROCRYPT '90 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
On Necessary and Sufficient Conditions for the Construction of Super Pseudorandom Permutations
ASIACRYPT '91 Proceedings of the International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
ASIACRYPT '91 Proceedings of the International Conference on the Theory and Applications of Cryptology: Advances in Cryptology
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Separating Quantum and Classical Learning
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Hi-index | 0.00 |
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.