Improved Linear Hull Attack on Round-Reduced Simon with Dynamic Key-Guessing Techniques

@article{Chen2015ImprovedLH,
  title={Improved Linear Hull Attack on Round-Reduced Simon with Dynamic Key-Guessing Techniques},
  author={Huaifeng Chen and Xiaoyun Wang},
  journal={IACR Cryptol. ePrint Arch.},
  year={2015},
  volume={2015},
  pages={666}
}
Simon is a lightweight block cipher family proposed by NSA in 2013. It has drawn many cryptanalysts' attention and varieties of cryptanalysis results have been published, including differential, linear, impossible differential, integral cryptanalysis and so on. In this paper, we give the improved linear attacks on all reduced versions of Simon with dynamic key-guessing technique, which was proposed to improve the differential attack on Simon recently. By establishing the boolean function of… 
Improved Integral Attacks on SIMON32 and SIMON48 with Dynamic Key-Guessing Techniques
TLDR
This paper presents dynamic key-guessing techniques first introduced in integral cryptanalysis and presents integral attacks on 24-round SIMON32, 24- round SIMON48/72, and 25-roundsimon48/96, which are better than any previously known attacks.
New integral attacks on SIMON
TLDR
The authors analyse the characteristic of the Boolean functions of SIMON32 and find that the presentation of zero-sum property is influenced by the degree of the corresponding Boolean function.
Linear Cryptanalysis of Reduced-Round SIMECK Variants
  • N. Bagheri
  • Computer Science, Mathematics
    INDOCRYPT
  • 2015
TLDR
It is shown that the security of this block cipher against linear cryptanalysis is not as good as its predecessors SIMON.
Truncated differential based known-key attacks on round-reduced SIMON
TLDR
These are the first known-key results on the block cipher SIMON, and a specific start-from-the-middle method for pre-adding extra rounds with complexities lower than generic bounds is designed.
Rotational-XOR Rectangle Cryptanalysis on Round-Reduced Simon
TLDR
This paper applies the Rotational-XOR-difference (RXD) approach to a non-ARX cipher Simon and evaluates its security, and establishes related-key rectangle distinguishers for round-reduced versions of Simon.
Linear Cryptanalysis of Reduced-Round SIMON Using Super Rounds
TLDR
These attacks result from the observation that, after four rounds of encryption, one bit of the left half of the state of 32/64 Simon depends on only 17 key bits, so the cost of the exhaustive search of linear cryptanalysis is reduced to 16 bits at a time for Simon 32/ 64.
Linear Hull Attack on Round-Reduced Simeck with Dynamic Key-Guessing Techniques
TLDR
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.
The Security of SIMON-like Ciphers Against Linear Cryptanalysis
TLDR
An automatic search algorithm is proposed, which can find the optimal linear trails in SIMON-like ciphers under the Markov assumption and derives 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.
SMT-based cube attack on round-reduced Simeck32/64
TLDR
This study introduces a new method which they call SMT-based cube attack, and applies it to improve the success of the solver in attacking reduced-round versions of Simeck32/64 lightweight block cipher, and results indicate that the proposed attack is more powerful than the cube attack.
Improved Automatic Search Algorithm for Differential and Linear Cryptanalysis on SIMECK and the Applications
TLDR
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.
...
...

References

SHOWING 1-10 OF 26 REFERENCES
Impossible Differential Cryptanalysis of Reduced Round SIMON
TLDR
This paper uses automatic-search technique to obtain the longest impossible differential paths of SIMON, and then proposes impossible differential attacks on SIMON32/64, which can reduce the complexity of data collecting phase greatly.
Cryptanalysis of Reduced-Round SIMON32 and SIMON48
TLDR
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.
Improved Linear Cryptanalysis of Round Reduced SIMON
TLDR
This work presents a connection between linear characteristic and differential characteristic, multiple linear and differential and linear hull and differential, and employs it to adapt the current known results on differential cryptanalysis of SIMON to linear crypt analysis of this block cipher.
Improved Linear Trails for the Block Cipher Simon
  • T. Ashur
  • Computer Science, Mathematics
    IACR Cryptol. ePrint Arch.
  • 2015
TLDR
This work improves previously published linear trail bias estimations by presenting a novel method to calculate the bias of short linear hulls in Simon and use them to construct longer linear approximations.
Cryptanalysis of SIMON Variants with Connections
TLDR
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.
Differential and Linear Cryptanalysis of Reduced-Round Simon Revision From October 9 , 2013
This paper presents differential attacks of round-reduced versions of Simon with up to 18/32, 19/36, 25/44, 35/54, and 46/72 rounds for the 32-, 48-, 64-, 96-, and 128-bit versions, respectively.
Scrutinizing and Improving Impossible Differential Attacks: Applications to CLEFIA, Camellia, LBlock and Simon (Full Version)
TLDR
This paper derives generic complexity analysis formulas for mounting such attacks and develops new ideas for optimizing impossible differential cryptanalysis, including for example the testing of parts of the internal state for reducing the number of involved key bits.
Differential Analysis of Block Ciphers SIMON and SPECK
TLDR
A graph based algorithm (linear time) for the computation of the exact differential probability of the main building block of Simon: an AND operation preceded by two bitwise shift operations gives a better insight into the differential property of the Simon round function and differential effect in the cipher.
The First Experimental Cryptanalysis of the Data Encryption Standard
TLDR
An improved version of linear cryptanalysis is described and its application to the first, successful computer experiment in breaking the full 16-round DES with high success probability if 243 random plaintexts and their ciphertexts are available.
Towards Finding the Best Characteristics of Some Bit-oriented Block Ciphers and Automatic Enumeration of ( Related-key ) Differential and Linear Characteristics with Predefined Properties
TLDR
This paper proposes an automatic method for finding high probability (related-key) differential or linear characteristics of block ciphers, and presents a novel MILP modelling technique which can be used to search for the characteristics with the maximal probability, rather than the characteristicsWith the smallest number of active S-boxes.
...
...