Abstract

In this paper we revisit the tequniques for collision attacks and study the relation between maximum differential characteristic probability and a limit of applicability of collision attack. We show that a cryptographic hash function is secure against collision attacks using a single message block based on differential attack if the unequality pD < (1 − e −1)2 −nm−1 is satisfied, where nm is an input length of a compression function and pD is the maximum differential characteristic probability.

Citations