[Resource Topic] 2023/255: Exploiting Non-Full Key Additions: Full-Fledged Automatic Demirci-Sel{\c{c}}uk Meet-in-the-Middle Cryptanalysis of SKINNY

Welcome to the resource topic for 2023/255

Title:
Exploiting Non-Full Key Additions: Full-Fledged Automatic Demirci-Sel{\c{c}}uk Meet-in-the-Middle Cryptanalysis of SKINNY

Authors: Danping Shi, Siwei Sun, Ling Song, Lei Hu, Qianqian Yang

Abstract:

The Demirci-Sel{\c{c}}uk meet-in-the-middle (DS-MITM) attack is
a sophisticated variant of differential attacks.
Due to its sophistication, it is hard to efficiently find the best
DS-MITM attacks on most ciphers \emph{except} for AES.
Moreover, the current automatic tools
only capture the most basic version of DS-MITM attacks, and the
critical techniques developed for enhancing the attacks
(e.g., differential enumeration and key-dependent-sieve) still rely
on manual work. In this paper, we develop a full-fledged automatic
framework integrating all known techniques
(differential enumeration, key-dependent-sieve, and key bridging, etc)
for the DS-MITM attack that can produce key-recovery
attacks directly rather than only search for distinguishers. Moreover,
we develop a new technique that is able to exploit partial key additions
to generate more linear relations beneficial to the attacks.
We apply the framework to the SKINNY family of block ciphers
and significantly improved results are obtained. In particular,
all known DS-MITM attacks on the respective versions of SKINNY are improved by at least 2 rounds,
and the data, memory, or time complexities of some attacks
are reduced even compared to previous best attacks penetrating less rounds.

ePrint: https://eprint.iacr.org/2023/255

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 .