The Security of Many-Round Luby-Rackoff Pseudo-Random Permutations
- 13 May 2003
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 544-561
- https://doi.org/10.1007/3-540-39200-9_34
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- The Security of Feistel Ciphers with Six Rounds or LessJournal of Cryptology, 2002
- Indistinguishability of Random SystemsLecture Notes in Computer Science, 2002
- How to Construct Pseudorandom and Super Pseudorandom Permutations from One Single Pseudorandom FunctionPublished by Springer Science and Business Media LLC ,2001
- A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation GeneratorsPublished by Springer Science and Business Media LLC ,2001
- On the Construction of Pseudorandom Permutations: Luby—Rackoff RevisitedJournal of Cryptology, 1999
- About Feistel Schemes with Six (or More) RoundsLecture Notes in Computer Science, 1998
- Faster Luby-Rackoff ciphersLecture Notes in Computer Science, 1996
- Foiling Birthday Attacks in Length-Doubling TransformationsLecture Notes in Computer Science, 1996
- How to Construct Pseudorandom Permutations from Pseudorandom FunctionsSIAM Journal on Computing, 1988
- How to construct random functionsJournal of the ACM, 1986