Some Plausible Constructions of Double-Block-Length Hash Functions

In this article, it is discussed how to construct a compression function with 2 n-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 functi...

Full description

Saved in:
Bibliographic Details
Published inFast Software Encryption pp. 210 - 225
Main Author Hirose, Shoichi
Format Book Chapter Conference Proceeding
LanguageEnglish
Published Berlin, Heidelberg Springer Berlin Heidelberg 2006
Springer
SeriesLecture Notes in Computer Science
Subjects
Applied sciences
Block Cipher
Compression Function
Computer science; control theory; systems
Exact sciences and technology
Hash Function
Memory and file management (including protection and security)
Memory organisation. Data processing
Random Oracle
Random Oracle Model
Software
Probabilistic approach
Information system
Collision
Block ciphering
Hashing
Reliability
Oracle
Modeling
Computer security
Computer attack
Online AccessGet full text

Cover

More Information
Summary:In this article, it is discussed how to construct a compression function with 2 n-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 the 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.
ISBN:9783540365976
3540365974
ISSN:0302-9743
1611-3349
DOI:10.1007/11799313_14