Luby-Rackoff Ciphers from Weak Round Functions?
- 1 January 2006
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- Vol. 2006, 391-408
- https://doi.org/10.1007/11761679_24
Abstract
No abstract availableKeywords
This publication has 15 references indexed in Scilit:
- Hybrid Symmetric Encryption Using Known-Plaintext Attack-Secure ComponentsLecture Notes in Computer Science, 2006
- Two-Pass Authenticated Encryption Faster Than Generic CompositionLecture Notes in Computer Science, 2005
- Black-Box Composition Does Not Imply Adaptive SecurityLecture Notes in Computer Science, 2004
- Composition of Random Systems: When Two Weak Make One StrongLecture Notes in Computer Science, 2004
- Indistinguishability of Random SystemsLecture Notes in Computer Science, 2002
- Constructing Pseudo-Random Permutations with a Prescribed StructureJournal of Cryptology, 2002
- On the Construction of Pseudorandom Permutations: Luby—Rackoff RevisitedJournal of Cryptology, 1999
- A Pseudorandom Generator from any One-way FunctionSIAM Journal on Computing, 1999
- How to construct random functionsJournal of the ACM, 1986
- Pseudo-random permutation generators and cryptographic compositionPublished by Association for Computing Machinery (ACM) ,1986