Katholieke Universiteit Leuven
Double block length hashing covers the idea of constructing a compression function on 2n bits using an n-bit block cipher. In this paper, the authors present a comprehensive indifferentiability analysis of all relevant double length compression functions. Indifferentiability is a stronger security notion than collision and preimage resistance and ensures that a design has no structural flaws. It is very well suited for composition: using an indifferentiable compression function in a proper mode of operation supplies an indifferentiable hash function.