Using Random Error Correcting Codes in Near-Collision Attacks on Generic Hash-Functions

In this paper we consider the problem of nding a near-collision with Hamming distance bounded by r in a generic cryptographic hash function h whose outputs can be modeled as random n-bit strings. In 2011, Lamberger suggested a modi ed version of Pollard's rho method which computes a chain of values by alternately applying the hash function h and an error… (More)