In November 2007, NIST opened a competition to develop a new cryptographic hash algorithm. On 2012-10-02, NIST announced Keccak (pronounced [kɛtʃak]) as the winner and the new SHA-3 algorithm (the selection process of the third and final round of the competition is summarized in NIST Interagency Report (IR) 7896).
The new paper Self-Differential Cryptanalysis of Up to 5 Rounds of SHA-3 (by Itai Dinur, Orr Dunkelman, and Adi Shamir) was published yesterday (2012-11-28). It uses a new type of self-differential attack and presents
the first published collision finding attacks on reduced-round versions of Keccak-384 and Keccak-512, providing actual collisions for 3-round versions, and describing attacks which are much faster than birthday attacks for 4-round Keccak-384.
The attack method is quite interesting: although it uses many ideas which were already known in some limited form, it improves and combines them in new ways. The attack most generally can be classified as a special type of subset cryptanalysis, that is it tries to track the flow of a certain set of values through the operations in the cryptographic scheme. The application of this method to hash functions, named by the researchers a squeeze attack, is motivated by the following observation. If a hash function maps set S into set D, then to find a collision we need a set S’ of inputs (a subset of S) of size that is the square root of the size of D (birthday paradox). If there is a way to include into S’ only those inputs that give outputs in D’ (a subset of D, such that size of D’ is only a fraction q of D), then the number of inputs we need in S’ is only the square root of the size of D’ (improvement by a factor of the square root of q). If the probability of picking an input in S’ is p, then as far as p is greater than the square root of q, we get an improved collision finding algorithm.
To apply the above idea to Keccak, the researches noted that most of the operations in Keccak have potentially dangerous symmetry properties. Although the asymmetric round constants remove the complete symmetry, the constants have very low Hamming weight and thus a fully symmetric state becomes an almost symmetric state. In the usual differential attacks, the attacker takes a pair of plaintexts, and follow the evolution of the difference during the cryptographic processing. The new self-differential attack follows the statistical evolution of a single almost symmetric state through the first few rounds of Keccak:
we construct subset characteristics such that each collection of internal states is defined using a set of relation which equates pairs of bits in the state, and define a self-difference as the affine solution space of these linear equations over GF(2). We call the special case of subset cryptanalysis in which the subsets used in the characteristic are self-differences, self-differential cryptanalysis.

