Welcome to the resource topic for 1999/017
Title:
A Composition Theorem for Universal One-Way Hash Functions
Authors: Victor Shoup
Abstract:In this paper we present a new scheme for constructing
universal one-way hash functions that hash arbitrarily long messages
out of universal one-way hash functions that hash fixed-length messages.
The new construction is extremely simple and is also very efficient,
yielding shorter keys than previously proposed composition
constructions.
ePrint: https://eprint.iacr.org/1999/017
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .