How to generate cryptographically strong sequences of pseudo-random bits
SIAM Journal on Computing
How to construct random functions
Journal of the ACM (JACM)
One-way functions and pseudorandom generators
STOC '85 Proceedings of the seventeenth annual ACM symposium on Theory of computing
How to construct pseudorandom permutations from pseudorandom functions
SIAM Journal on Computing - Special issue on cryptography
On the construction of a random number generator and random function generators
Lecture Notes in Computer Science on Advances in Cryptology-EUROCRYPT'88
Impossibility and optimally results on constructing pseudorandom permutations (extended abstract)
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
On the security of Schnorr's pseudo random generator
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Perfect local randomness in pseudo-random sequences
CRYPTO '89 Proceedings on Advances in cryptology
CRYPTO '89 Proceedings on Advances in cryptology
Theory and application of trapdoor functions
SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Improved security bounds for pseudorandom permutations
Proceedings of the 4th ACM conference on Computer and communications security
Separating Quantum and Classical Learning
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
New Results on Pseudorandom Permutation Generators Based on the DES Scheme
CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
About Feistel Schemes with Six (or More) Rounds
FSE '98 Proceedings of the 5th International Workshop on Fast Software Encryption
Towards Making Luby-Rackoff Ciphers Optimal and Practical
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
On the Construction of Variable-Input-Length Ciphers
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
Secure Implementation of the Stern Authentication and Signature Schemes for Low-Resource Devices
CARDIS '08 Proceedings of the 8th IFIP WG 8.8/11.2 international conference on Smart Card Research and Advanced Applications
Higher-Order Masking and Shuffling for Software Implementations of Block Ciphers
CHES '09 Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems
Probabilistic analysis of elementary randomizers
EUROCRYPT'91 Proceedings of the 10th annual international conference on Theory and application of cryptographic techniques
A simplified and generalized treatment of Luby-Rackoff pseudorandom permutation generators
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
A construction for super pseudorandom permutations from a single pseudorandom function
EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques
Resistance against general iterated attacks
EUROCRYPT'99 Proceedings of the 17th international conference on Theory and application of cryptographic techniques
On the universal hash functions in Luby-Rackoff cipher
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
The security of many-round Luby-Rackoff pseudo-random permutations
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
Luby-Rackoff ciphers from weak round functions?
EUROCRYPT'06 Proceedings of the 24th annual international conference on The Theory and Applications of Cryptographic Techniques
| Hi-index | 0.00 |
The paper examines permutation generators which are designed using four rounds of the Data Encryption Standard and a single pseudorandom function. We have proved that such generators are pseudorandom only if the pseudorandom function is used internally at least five times. The proof is given using two different approaches: deterministic and probabilistic. Some cryptographic implications are also discussed.