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
Resynchronization weaknesses in synchronous stream ciphers
EUROCRYPT '93 Workshop on the theory and application of cryptographic techniques on Advances in cryptology
Synthesizers and their application to the parallel construction of pseudo-random functions
Journal of Computer and System Sciences - Special issue on the 36th IEEE symposium on the foundations of computer science
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Modern Cryptography, Probabilistic Proofs, and Pseudorandomness
Feistel Ciphers with L2-Decorrelation
SAC '98 Proceedings of the Selected Areas in Cryptography
Adaptive-Attack Norm for Decorrelation and Super-Pseudorandomness
SAC '99 Proceedings of the 6th Annual International Workshop on Selected Areas in Cryptography
Provable Security for Block Ciphers by Decorrelation
STACS '98 Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science
Expanding Pseudorandom Functions; or: From Known-Plaintext Security to Chosen-Plaintext Security
CRYPTO '02 Proceedings of the 22nd Annual International Cryptology Conference on Advances in Cryptology
On the Construction of Block Ciphers Provably Secure and Not Relying on Any Unproved Hypotheses
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
CRYPTO '98 Proceedings of the 18th Annual International Cryptology Conference on Advances in Cryptology
Indistinguishability of Random Systems
EUROCRYPT '02 Proceedings of the International Conference on the Theory and Applications of Cryptographic Techniques: Advances in Cryptology
On the Pseudorandomness of Top-Level Schemes of Block Ciphers
ASIACRYPT '00 Proceedings of the 6th International Conference on the Theory and Application of Cryptology and Information Security: Advances in Cryptology
Proceedings of the Third International Workshop on Fast Software Encryption
Two Practical and Provably Secure Block Ciphers: BEARS and LION
Proceedings of the Third International Workshop on Fast Software Encryption
MMH: Software Message Authentication in the Gbit/Second Rates
FSE '97 Proceedings of the 4th 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
High-Speed Pseudorandom Number Generation with Small Memory
FSE '99 Proceedings of the 6th International Workshop on Fast Software Encryption
New Results on the Pseudorandomness of Some Blockcipher Constructions
FSE '01 Revised Papers from the 8th International Workshop on Fast Software Encryption
A Concrete Security Treatment of Symmetric Encryption
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Number-theoretic constructions of efficient pseudo-random functions
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
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
On the universal hash functions in Luby-Rackoff cipher
ICISC'02 Proceedings of the 5th international conference on Information security and cryptology
Tweakable enciphering schemes from hash-sum-expansion
INDOCRYPT'07 Proceedings of the cryptology 8th international conference on Progress in cryptology
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 |
This paper describes a hybrid symmetric cipher that combines a strongly-secure function, e.g., a pseudorandom function (PRF), which is secure against any Chosen-Plaintext Attack, and a weak PRF, which is only secure against any Known-Plaintext Attack. Although this kind of composition is potentially faster than the modes of PRFs, it has not been extensively studied. Our main contribution is in proposing a new block cipher scheme that is suitable for hybrid composition. We describe efficient hybrid constructions of pseudorandom permutation and strong pseudorandom permutation for an arbitrarily large block size using our new scheme.