Cryptanalysis of a Provably Secure Cryptographic Hash Function
We present a cryptanalysis of a provably secure cryptographic hash function proposed by Augot, Finiasz and Sendrier in [1]. Our attack is a variant of Wagner’s generalized birthday attack. It is significantly faster than the attack considered in [1], and it is practical for two of the three proposed parameters.