Some Plausible Constructions of Double-Block-Length Hash Functions (2006)
| Venue: | FSE’06, LNCS 4047 |
| Citations: | 17 - 0 self |
BibTeX
@INPROCEEDINGS{Hirose06someplausible,
author = {Shoichi Hirose},
title = {Some Plausible Constructions of Double-Block-Length Hash Functions},
booktitle = {FSE’06, LNCS 4047},
year = {2006},
pages = {210--225},
publisher = {Springer-Verlag}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Abstract. In this article, it is discussed how to construct a compression function with 2n-bit output using a component function with n-bit output. The component function is either a smaller compression function or a block cipher. Some constructions are presented which compose collision-resistant hash functions: Any collision-finding attack on them is at most as efficient as a birthday attack in the random oracle model or in the ideal cipher model. A new security notion is also introduced, which we call indistinguishability in the iteration, with a construction satisfying the notion.
Citations
| 87 | Collision free hash functions and public key signature schemes - Damg˚ard |
| 78 | An analysis of the blockcipher-based hash functions from PGV - Black, Rogaway, et al. |
| 51 | Merkle-Damgård Revisited: How to Construct a Hash Function - Coron, Dodis, et al. - 2005 |
| 16 | Data Authentication Using Modification Detection Codes Based on a Public One Way Encryption Function. U.S. Patent Number 4,908,861 - Brachtl, Coppersmith, et al. - 1990 |
| 14 | Provably Secure Double-Block-Length Hash Functions in a Black-Box Model - Hirose - 2004 |
| 10 | Security of iterated hash function based on block ciphers - Hohl, Lai, et al. - 1993 |
| 6 | Analysis of Double Block Length Hash Functions - Hattori, Hirose, et al. - 2003 |
| 5 | On the Impossibility of Highly Efficient Block Cipher-based Hash Functions - Black, Cochran, et al. - 2005 |
