The most efficient collision attacks on members of the SHA family presented so far all use
complex characteristics which were manually constructed by Wang et al. In this report, we …

Several standard cryptographic hash functions were broken in 2005. Some essential
building blocks of these attacks lend themselves well to automation by encoding them as …

While differential behavior of modern ciphers in a single secret key scenario is relatively well
understood, and simple techniques for computation of security lower bounds are readily …

Differential and linear cryptanalysis are the general purpose tools to analyze various
cryptographic primitives. Both techniques have in common that they rely on the existence of …

In this paper, we study differential attacks against ARX schemes. We build upon the
generalized characteristics of de Cannière and Rechberger; we introduce new multi-bit …

In this paper, we study differential attacks against ARX schemes. We build upon the
generalized characteristics of De Cannière and Rechberger and the multi-bit constraints of …

In this paper, we propose an automatic tool to search for optimal differential and linear trails
in ARX ciphers. It's shown that a modulo addition can be divided into sequential small …

Abstract At Crypto'06, Bellare presented new security proofs for HMAC and NMAC, under
the assumption that the underlying compression function is a pseudo-random function …

In this work, we present practical semi-free-start collisions for SHA-512 on up to 38 (out of
80) steps with complexity 2^ 40.5. The best previously published result was on 24 steps. The …

This paper proposes several approaches to improve the collision attack on MD4 proposed
by Wang et al. First, we propose a new local collision that is the best for the MD4 collision …