Building PRFs from PRPs
- 1 January 1998
- book chapter
- Published by Springer Nature
- Vol. 1462, 370-389
- https://doi.org/10.1007/bfb0055742
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- Pseudorandom functions revisited: the cascade construction and its concrete securityPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- New Results on Pseudorandom Permutation Generators Based on the Des SchemePublished by Springer Nature ,2001
- About Feistel Schemes with Six (or More) RoundsPublished by Springer Nature ,1998
- Improved security bounds for pseudorandom permutationsPublished by Association for Computing Machinery (ACM) ,1997
- Foiling Birthday Attacks in Length-Doubling TransformationsPublished by Springer Nature ,1996
- On necessary and sufficient conditions for the construction of super pseudorandom permutationsPublished by Springer Nature ,1993
- How to Construct Pseudorandom Permutations from Single Pseudorandom FunctionsPublished by Springer Nature ,1991
- 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