Consider the following proposal for a cryptographic hash function, that makes use of a block cipher E
Fantastic news! We've Found the answer you've been seeking!
Question:
hi = Emi (hi – 1) for i = 1, 2, ............n. The hash of the message is hn. Show that one can apply meet - in-the-middle attack (with birthday paradox) to find a preimage of the form all x Il y for a given hash value hi.
Related Book For
Introduction to Data Mining
ISBN: 978-0321321367
1st edition
Authors: Pang Ning Tan, Michael Steinbach, Vipin Kumar
Posted Date: