Sciweavers

IJISEC
2016

On selection of samples in algebraic attacks and a new technique to find hidden low degree equations

7 years 11 months ago
On selection of samples in algebraic attacks and a new technique to find hidden low degree equations
The best way of selecting samples in algebraic attacks against block ciphers is not well explored and understood. We introduce a simple strategy for selecting the plaintexts and demonstrate its strength by breaking reduced-round KATAN32 and LBlock. In both cases, we present a practical attack which outperforms previous attempts of algebraic cryptanalysis whose complexities were close to exhaustive search. The attack is based on the selection of samples using cube attack and ElimLin which was presented at FSE’12, and a new technique called Universal Proning. In the case of LBlock, we break 10 out of 32 rounds. In KATAN32, we break 78 out of 254 rounds. Unlike previous attempts which break smaller number of rounds, we do not guess any bit of the key and we only use structural properties of the cipher to be able to break a higher number of rounds with much lower complexity. We show that cube attacks owe their success to the same properties and therefore, can be used as a heuristic for s...
Petr Susil, Pouyan Sepehrdad, Serge Vaudenay, Nico
Added 05 Apr 2016
Updated 05 Apr 2016
Type Journal
Year 2016
Where IJISEC
Authors Petr Susil, Pouyan Sepehrdad, Serge Vaudenay, Nicolas Courtois
Comments (0)