• Publications
  • Influence
Cube Attacks on Tweakable Black Box Polynomials
This paper develops a new technique (called a cube attack ) for solving tweakable polynomials, which is a major improvement over several previously published attacks of the same type. Expand
Cube Testers and Key Recovery Attacks on Reduced-Round MD6 and Trivium
This paper applies cube attacks to reduced round MD6, finding the full 128-bit key of a 14-round MD6 with complexity 2\^22 (which takes less than a minute on a single PC) and introduces a new class of attacks called cube testers, based on efficient property-testing algorithms, and applies them to MD6 and to the stream cipher Trivium. Expand
Breaking Grain-128 with Dynamic Cube Attacks
This is the first time that a cube attack was shown to be effective against the full version of a well known cipher which resisted all previous attacks. Expand
An Experimentally Verified Attack on Full Grain-128 Using Dedicated Reconfigurable Hardware
In this paper we describe the first single-key attack which can recover the full key of the full version of Grain-128 for arbitrary keys by an algorithm which is significantly faster than exhaustiveExpand
Improved Differential Cryptanalysis of Round-Reduced Speck
  • Itai Dinur
  • Computer Science, Mathematics
  • IACR Cryptol. ePrint Arch.
  • 14 August 2014
The best previously published attacks on all the 20 round-reduced ciphers are differential attacks, and are described in two papers (presented at FSE 2014) by Abed et al. and Biryukov etAl. Expand
Improved Attacks on Full GOST
A new fixed point property is introduced and a better way to attack 8-round GOST in order to find improved attacks on full GOST, which can be reduced from an impractical 264 to a practical 236 without changing the 2224 time complexity. Expand
Cube Attacks and Cube-Attack-Like Cryptanalysis on the Round-Reduced Keccak Sponge Function
This analysis covers a wide range of key recovery, MAC forgery and other types of attacks, breaking up to 9 rounds (out of the full 24) of the Keccak internal permutation much faster than exhaustive search. Expand
Side Channel Cube Attacks on Block Ciphers
A new variant of cube attack is developed which can tolerate considerable levels of noise and is demonstrated by describing efficient leakage attacks on two of the best known block ciphers, AES and SERPENT. Expand
New Attacks on Keccak-224 and Keccak-256
Improved collision finding techniques are developed which enable us to double the number of Keccak rounds for which actual collisions were found, and can now find within a few minutes on a single PC actual collisions in standard KeCCak-224 and Keccack-256, where the only modification is to reduce their number of rounds to 4. Expand
Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
The generality of the new dissection technique is shown, which is used in a generic way in order to attack hash functions with a rebound attack, to solve hard knapsack problems, and to find the shortest solution to a generalized version of Rubik's cube with better time complexities for small memory complexities. Expand