We found a match
Your institution may have rights to this item. Sign in to continue.
- Title
How to Stretch Random Functions: The Security of Protected Counter Sums.
- Authors
Bernstein, Daniel J.
- Abstract
Let f be an unpredictable random function taking (b +c)-bit inputs to b-bit outputs. This paper presents an unpredictable random function f' taking variable-length inputs to b-bit outputs. This construction has several advantages over chaining, which was proven unpredictable by Bellare, Kilian, and Rogaway, and cascading, which was proven unpredictable by Bellare, Canetti, and Krawczyk. The highlight here is a very simple proof of security.
- Subjects
RANDOM variables; SECURITY systems
- Publication
Journal of Cryptology, 1999, Vol 12, Issue 3, p185
- ISSN
0933-2790
- Publication type
Article
- DOI
10.1007/s001459900051