[Resource Topic] 2014/279: Improved Impossible Differential Attacks against Round-Reduced LBlock

Welcome to the resource topic for 2014/279

Title:
Improved Impossible Differential Attacks against Round-Reduced LBlock

Authors: Christina Boura, Marine Minier, María Naya-Plasencia, Valentin Suder

Abstract:

Impossible differential attacks are among the most powerful forms of cryptanalysis against block ciphers. We present in this paper an in-depth complexity analysis of these attacks. We show an unified way to mount such attacks and provide generic formulas for estimating their time, data and memory complexities. LBlock is a well studied lightweight block cipher with respect to impossible differential attacks. While previous single-key cryptanalysis reached up to 22 rounds, by applying our method we are able to break 23 rounds with time complexity 2^{75.36} and data complexity 2^{59}. Other time/data trade-offs are equally possible. This is to our knowledge the best (non-exhaustive search like) cryptanalysis of this function in the single-key model.

ePrint: https://eprint.iacr.org/2014/279

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .