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.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received 10 April 1997 and revised 7 January 1998
Rights and permissions
About this article
Cite this article
Bernstein, D. How to Stretch Random Functions: The Security of Protected Counter Sums . J. Cryptology 12, 185–192 (1999). https://doi.org/10.1007/s001459900051
Published:
Issue Date:
DOI: https://doi.org/10.1007/s001459900051