Indistinguishability of Random Systems
Top Cited Papers
- 29 April 2002
- book chapter
- Published by Springer Nature
- p. 110-132
- https://doi.org/10.1007/3-540-46035-7_8
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- How to Construct Pseudorandom and Super Pseudorandom Permutations from One Single Pseudorandom FunctionPublished by Springer Nature ,2001
- A Simplified and Generalized Treatment of Luby-Rackoff Pseudorandom Permutation GeneratorsPublished by Springer Nature ,2001
- CBC MAC for Real-Time Data SourcesJournal of Cryptology, 2000
- UMAC: Fast and Secure Message AuthenticationPublished by Springer Nature ,1999
- How to Stretch Random Functions: The Security of Protected Counter SumsJournal of Cryptology, 1999
- On the Construction of Pseudorandom Permutations: Luby—Rackoff RevisitedJournal of Cryptology, 1999
- About Feistel Schemes with Six (or More) RoundsPublished by Springer Nature ,1998
- How to Construct Pseudorandom Permutations from Pseudorandom FunctionsSIAM Journal on Computing, 1988
- How to construct random functionsJournal of the ACM, 1986
- How to Generate Cryptographically Strong Sequences of Pseudorandom BitsSIAM Journal on Computing, 1984