SIMON and SIMECK are two lightweight block ciphers with a simple round function using only word rotations and a bit-wise AND operation. Previous work has shown a strong clustering effect for differential and linear cryptanalysis, due to the existence of many trails with the same inputs and outputs. In this paper, we explore this clustering effect by exhibiting a class of high probability differential and linear trails where the active bits stay in a fixed window of w bits. Instead of enumerating a set of good trails contributing to a differential or a linear approximation, we compute the probability distribution over this space, including all trails in the class. This results in stronger distinguishers than previously proposed, and we describe key recovery attacks against SIMON and SIMECK improving the previous results by up to 7 rounds. In particular, we obtain an attack against 42-round SIMECK 64, leaving only two rounds of security margin, and an attack against 45-round SIMON 96/144, reducing the security margin from 16 rounds to 9 rounds.

, , , , ,
Lecture Notes in Computer Science
27th Annual International Conference on the Theory and Application of Cryptology and Information Security, ASIACRYPT 2021

Leurent, G., Pernot, C., & Schrottenloher, A. (2021). Clustering effect in Simon and Simeck. In Advances in Cryptology - ASIACRYPT 2021 (pp. 272–302). doi:10.1007/978-3-030-92062-3_10