Cryptanalysis of Iterated Hash and its Variants.

Date of Submission

December 2015

Date of Award

Winter 12-12-2016

Institute Name (Publisher)

Indian Statistical Institute

Document Type

Master's Dissertation

Degree Name

Master of Technology

Subject Name

Computer Science


Applied Statistics Unit (ASU-Kolkata)


Nandi, Mridul (ASU-Kolkata; ISI)

Abstract (Summary of the Work)

The subject of this thesis is the cryptanalysis of iterated hash function and its variants. In particular, we analyse these designs on three security properties of hash functions, namely, preimage resistance, second preimage resistance and herding attack resistance.The iterated hash design is the most popular hash function design. Naturally, it is the most studied design as well. In this thesis, we try to do a comprehensive survey of attacks under random oracle model, on the aforementioned security goals of the iterated hash design and its variants.Structures play a major role in constructing attacks on the iterated hash functions. Here, we are proposing three new structures, viz., chain, multi-pipe expandable message set and rho structure. The chain structure is used to reduce the complexity of herding attack on iterated hash from O(22n/3 ) to O(2n/2). The multi-pipe expandable message set and rho structure are used in our analysis of the zipper hash. We also analyse the security of concatenated hash under cetain weakness assumptions on the underlying compression functions.


ProQuest Collection ID:

Control Number


Creative Commons License

Creative Commons Attribution 4.0 International License
This work is licensed under a Creative Commons Attribution 4.0 International License.


This document is currently not available here.