Security evaluation on Simeck against zero-correlation linear cryptanalysis

  title={Security evaluation on Simeck against zero-correlation linear cryptanalysis},
  author={Kai Zhang and Jie Guan and B. Hu and Dongdai Lin},
  journal={IET Inf. Secur.},
Since proposed by the National Security Agency in June 2013, two lightweight block ciphers-SIMON and SPECK have attracted the attention of cryptographers from all over the world. At CHES 2015, Simeck, a new block cipher inspired from both SIMON and SPECK is proposed, which is more compact and efficient. However, the security evaluation on Simeck against zero-correlation linear cryptanalysis seems missing from the specification. The main focus of this study is to fill this gap and evaluate the… 

Figures from this paper

Integral cryptanalysis on Simeck
  • Kai Zhang, Jie Guan, Bin Hu, D. Lin
  • Mathematics, Computer Science
    2016 Sixth International Conference on Information Science and Technology (ICIST)
  • 2016
With these integral distinguishers, Simeck32/48/64 reduced to 21/21/24 rounds respectively can be attacked with integral cryptanalysis.
Improved Integral Attack on Reduced-Round Simeck
The new results of integral cryptanalysis on reduced-round Simeck are given and the exact algebraic degree of Simek32 is given by parallel computing, and the 13-round theoretical integral distinguisher is proposed to attack 20-roundSimeck32(64).
Differential Security Evaluation of Simeck with Dynamic Key-guessing Techniques
This paper implements the dynamic key-guessing techniques in a program to automatically give out the data in dynamicKeyGuessing procedure and thus simplify the security evaluation of SIMON and Simeck like block ciphers regarding differential attacks.
Differential Analysis on Simeck and SIMON with Dynamic Key-Guessing Techniques
The dynamic key-guessing techniques are converted to a program that can automatically give out the data in dynamicKeyGuessing procedure and, with this tool, the differential security evaluation of SIMON and Simeck like block ciphers becomes very convenient.
Improved Automatic Search Algorithm for Differential and Linear Cryptanalysis on SIMECK and the Applications
This paper analysis the properties of the round function of SIMECK, and eliminates the repeated use of rotational independence judgment condition in Liu’s algorithm that proposed in FSE’17, constructing the partial difference distribution table with limited Hamming weight of input difference to improve the search results.
Correlated Sequence Attack on Reduced-Round Simon-32/64 and Simeck-32/64
  • R. Rohit, G. Gong
  • Computer Science, Mathematics
    IACR Cryptol. ePrint Arch.
  • 2018
In this paper, we propose a novel cryptanalytic technique called correlated sequence attack on block ciphers. Our attack exploits the properties of given key dependent sequences of length t to obtain
Performance Analysis on Enhanced Round Function of SIMECK Block Cipher
A comparative study on the performance analysis of the enhanced round function of the SIMECK Family block cipher shows an efficient performance over the original algorithm in different simulations using the following methods of measurement; avalanche effect, runtime performance, and brute-force attack.
Related-key differential analysis of round-reduced simeck
  • S. Wang
  • Mathematics, Computer Science
    2017 International Conference on I-SMAC (IoT in Social, Mobile, Analytics and Cloud) (I-SMAC)
  • 2017
A 14-round related-key differential distinguisher for the Simeck32/64, modelling is the known best and the probability is calculated under consideration of the dependence of AND operations.
Linear Hull Attack on Round-Reduced Simeck with Dynamic Key-Guessing Techniques
This paper searches out Simeck's differentials with low Hamming weight and high probability using Kolbl's tool, then exploits the links between differentials and linear characteristics to construct linear hulls for Simeke, giving improved linear hull attack with dynamic key-guessing techniques on Simek on the basis of round function's property.


Improved Zero-Correlation Cryptanalysis on SIMON
This paper is the first one to give zero-correlation linear approximations of SIMON64, SIMON96 and SIMON128, which are also utilized to attack the corresponding ciphers.
Linear Cryptanalysis of Reduced-Round SIMECK Variants
  • N. Bagheri
  • Computer Science, Mathematics
  • 2015
It is shown that the security of this block cipher against linear cryptanalysis is not as good as its predecessors SIMON.
Cryptanalysis of Reduced-Round SIMON32 and SIMON48
This paper presents a novel experimental approach to construct the best known integral distinguishers of SIMON32, and proposes new impossible differential attacks which improve the previous impossibility differential attacks.
Linear hulls with correlation zero and linear cryptanalysis of block ciphers
This work introduces a novel extension of linear crypt analysis: zero-correlation linear cryptanalysis, a technique applicable to many block cipher constructions based on linear approximations with a correlation value of exactly zero.
Zero Correlation Linear Cryptanalysis with Reduced Data Complexity
The findings of this paper demonstrate that the prohibitive data complexity requirements are not inherent in the zero correlationlinear cryptanalysis and can be overcome and suggest that zero correlation linear cryptanalysis can actually break more rounds than the best known impossible differential cryptanalysis does for relevant block ciphers.
Cryptanalysis of SIMON Variants with Connections
This work presents several linear characteristics for reduced-round SIMON32/64 that can be used for a key-recovery attack and extend them further to attack other variants of SIMON, and exploits a connection between linear and differential characteristics for SIMON to constructlinear characteristics for different variants of reduced- round SIMON.
The Simeck Family of Lightweight Block Ciphers
This paper introduces Simeck, a new family of lightweight block ciphers that combines the good design components from both Simon and Speck, in order to devise even more compact and efficient blockciphers.
Generic Key Recovery Attack on Feistel Scheme
This work proposes new generic key recovery attacks on Feistel-type block ciphers based on the all subkeys recovery approach presented in SAC 2012, which determinesall subkeys instead of the master key to construct a key recovery attack without taking into account a key scheduling function.
A Brief Comparison of Simon and Simeck
The design allows a smaller and more efficient hardware implementation, its security margins are not well understood, and the lack of design rationals of its predecessors further leaves some uncertainty on the security of Simeck.