Stateless Evaluation of Pseudorandom Functions: Security Beyond the Birthday Barrier
- 16 December 1999
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
- p. 270-287
- https://doi.org/10.1007/3-540-48405-1_17
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- 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
- Improved security bounds for pseudorandom permutationsPublished by Association for Computing Machinery (ACM) ,1997
- MDx-MAC and Building Fast MACs from Hash FunctionsLecture Notes in Computer Science, 1995
- How to Construct Pseudorandom Permutations from Pseudorandom FunctionsSIAM Journal on Computing, 1988
- How to construct random functionsJournal of the ACM, 1986
- New hash functions and their use in authentication and set equalityJournal of Computer and System Sciences, 1981