Constructing an Ideal Hash Function from Weak Ideal Compression Functions
Speaker: Moses Liskov , The College of William and Maryl
Date: October 27 2006
Time: 10:30AM to 12:00PM
Location: 32-G449 (Patil/Kiva)
Contact: Be Blackburn, 3-6098, imbe@mit.edu
Relevant URL:
We introduce the notion of a weak ideal compression
function, which is vulnerable to strong forms of attack, but is
otherwise random. We show that such weak ideal compression functions
can be used to create secure hash functions, thereby giving a design
that can be used to eliminate attacks caused by undesirable
properties of compression functions. We prove that the construction
we give, which we call the "zipper hash," is ideal in the sense that
the overall hash function is indistinguishable from a random oracle
when implemented with these weak ieal building blocks. The zipper
hash function is relatively simple, requiring two compression
function evaluations per block of input, but it is not streamable.
We also show how to create an ideal (strong) compression function
from ideal weak compression functions, which can be used in the
standard iterated way to make a streamable hash function.
See other events that are part of Cryptography and Information Security Seminar Seminars 2006/2007
See other events happening in October 2006
