How to Stretch Random Functions: The Security of Protected Counter Sums (1999)
by
Daniel J. Bernstein
| Venue: | Journal of Cryptology |
| Citations: | 18 - 7 self |
BibTeX
@ARTICLE{Bernstein99howto,
author = {Daniel J. Bernstein},
title = {How to Stretch Random Functions: The Security of Protected Counter Sums},
journal = {Journal of Cryptology},
year = {1999},
volume = {12},
pages = {185--192}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
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 0 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. 1.
