Paper 1999/017 Original: eprint.iacr.org/1999/017 ↗
A Composition Theorem for Universal One-Way Hash Functions
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.
Metadata
- Available format(s)
PDF- Publication info
- Preprint.
- History
- 1999-07-22: last updated
- 1999-07-22: published
- Short URL
- https://ia.cr/1999/017
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:1999/017,
author = {Victor Shoup},
title = {A Composition Theorem for Universal One-Way Hash Functions},
howpublished = {Cryptology {ePrint} Archive, Paper 1999/017},
year = {1999},
url = {https://eprint.iacr.org/1999/017}
}