Lucks, Stefan
A Collision-Resistant Rate-1 Double-Block-Length Hash Function
Abstract
This paper proposes a construction for collision resistant
$2n$-bit hash functions, based
on $n$-bit block ciphers with $2n$-bit keys. The construction is analysed
in the ideal cipher model; for $n=128$ an adversary would need roughly
$2^{122}$ units of time to find a collision.
The construction employs ``combinatorial'' hashing
as an underlying building block (like
Universal Hashing for cryptographic
message authentication by Wegman and Carter).
The construction runs at rate~1, thus improving on a similar
rate~1/2 approach by Hirose (FSE 2006).
BibTeX - Entry
@InProceedings{lucks:DSP:2007:1017,
author = {Stefan Lucks},
title = {A Collision-Resistant Rate-1 Double-Block-Length Hash Function},
booktitle = {Symmetric Cryptography},
year = {2007},
editor = {Eli Biham and Helena Handschuh and Stefan Lucks and Vincent Rijmen},
number = {07021},
series = {Dagstuhl Seminar Proceedings},
ISSN = {1862-4405},
publisher = {Internationales Begegnungs- und Forschungszentrum f{\"u}r Informatik (IBFI), Schloss Dagstuhl, Germany},
address = {Dagstuhl, Germany},
URL = {http://drops.dagstuhl.de/opus/volltexte/2007/1017},
annote = {Keywords: Hash function, provable security, double-block-length}
}
|
Keywords: |
|
Hash function, provable security, double-block-length |
|
Seminar: |
|
07021 - Symmetric Cryptography
|
|
Issue date: |
|
2007 |
|
Date of publication: |
|
06.06.2007 |
06.06.2007
