A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation Generators
- 18 May 2001
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC
- p. 239-255
- https://doi.org/10.1007/3-540-47555-9_21
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Impossibility and Optimality Results on Constructing Pseudorandom PermutationsPublished by Springer Science and Business Media LLC ,2001
- How to Construct Pseudorandom Permutations from Single Pseudorandom FunctionsLecture Notes in Computer Science, 1991
- Local randomness in pseudorandom sequencesJournal of Cryptology, 1991
- On the power of two-point based samplingJournal of Complexity, 1989
- How to Construct Pseudorandom Permutations from Pseudorandom FunctionsSIAM Journal on Computing, 1988
- On the Construction of Random Number Generators and Random Function GeneratorsLecture Notes in Computer Science, 1988
- How to construct random functionsJournal of the ACM, 1986
- Relative to a Random OracleA, ${\bf P}^A \ne {\bf NP}^A \ne \text{co-}{\bf NP}^A $ with Probability 1SIAM Journal on Computing, 1981
- On a Set of Almost Deterministic $k$-Independent Random VariablesThe Annals of Probability, 1974
- Pairwise Statistical IndependenceThe Annals of Mathematical Statistics, 1965