Paper 2017/576

The Security of SIMON-like Ciphers Against Linear Cryptanalysis

Zhengbin Liu, Yongqiang Li, and Mingsheng Wang

Abstract

In the present paper, we analyze the security of SIMON-like ciphers against linear cryptanalysis. First, an upper bound is derived on the squared correlation of SIMON-like round function. It is shown that the upper bound on the squared correlation of SIMON-like round function decreases with the Hamming weight of output mask increasing. Based on this, we derive an upper bound on the squared correlation of linear trails for SIMON and SIMECK, which is $2^{-2R+2}$ for any $R$-round linear trail. We also extend this upper bound to SIMON-like ciphers. Meanwhile, an automatic search algorithm is proposed, which can find the optimal linear trails in SIMON-like ciphers under the Markov assumption. With the proposed algorithm, we find the provably optimal linear trails for $12$, $16$, $19$, $28$ and $37$ rounds of SIMON$$. To the best of our knowledge, it is the first time that the provably optimal linear trails for SIMON$$, SIMON$$ and SIMON$$ are reported. The provably optimal linear trails for $$, $$ and $$ rounds of SIMECK$$ are also found respectively. Besides the optimal linear trails, we also find the $$, $$ and $$-round linear hulls for SIMON$$, and $$, $$ and $$-round linear hulls for SIMECK$$. As far as we know, these are the best linear hull distinguishers for SIMON and SIMECK so far. Compared with the approach based on SAT/SMT solvers in \cite{KolblLT15}, our search algorithm is more efficient and practical to evaluate the security against linear cryptanalysis in the design of SIMON-like ciphers.