Abstract
In this paper, we study variants of the parallel hash function construction of Damgård. We first show an improvement such that the number of processors is almost a half if |M| = (2s + 1)n for some s, where M is the message to be hashed. We next show that there exists a variant of our parallel hash construction such that it is secure even if the underlying compression function is not necessarily collision-free nor one-way. The cost is that some constant times more processors are required.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Black, P. Rogaway, and T. Shrimpton, “Black-box analysis of the block-cipher-based hash-function constructions from PGV”, In Advances in Cryptology — CRYPTO’ 02, Lecture Notes in Computer Science, pages 320–335. Springer-Verlag, 2002.
I. Damgård, “A design principle for hash functions ”, In Advances in Cryptology — CRYPTO’ 89, Lecture Notes in Computer Science, pages 416–427. Springer-Verlag, 1990.
J. Kilian and P. Rogaway, “How to protect DES against exhaustive key search”, Journal of Cryptology, 14(1):17–35, 2001. Earlier version in CRYPTO’ 96.
B. Preneel, R. Govaerts, and J. Vandewalle, “Hash functions based on block ciphers: A synthetic approach”, In Advances in Cryptology — CRYPTO’ 93, Lecture Notes in Computer Science, pages 368–378. Springer-Verlag, 1994.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Matsuo, T., Kurosawa, K. (2003). On Parallel Hash Functions Based on Block-Cipher. In: Safavi-Naini, R., Seberry, J. (eds) Information Security and Privacy. ACISP 2003. Lecture Notes in Computer Science, vol 2727. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45067-X_44
Download citation
DOI: https://doi.org/10.1007/3-540-45067-X_44
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40515-3
Online ISBN: 978-3-540-45067-2
eBook Packages: Springer Book Archive