Applying MILP Method to Searching Integral Distinguishers Based on Division Property for 6 Lightweight Block Ciphers

Zhang, Xiang; Zhang, Wentao; Bao, Zhenzhen; Lin, Dongdai

doi:10.1007/978-3-662-53887-6_24

Cited by 177 publications

(238 citation statements)

References 23 publications

Supporting

Mentioning

237

Contrasting

Order By: Relevance

“…al. [21] also analyzed Simeck by using integral cryptanalysis and 15, 18 and 21-round distinguishers are found for Simeck32/64, Simeck48/96 and Simeck64/128 respectively. Nalla et al [3] have investigated Simeck using fault analysis.…”

Section: Related Workmentioning

confidence: 99%

A Security Analysis of IoT Encryption : Side Channel Cube Attack on SIMECK32/64

Buja¹,

Abdul‐Latip²,

Ahmad³

2018

IJCNC

View full text Add to dashboard Cite

Simeck, a lightweight block cipher has been proposed to be one of the encryption that can be employed in the Internet of Things (IoT) applications. Therefore, this paper presents the security of the Simeck32/64 block cipher against side-channel cube attack. We exhibit our attack against Simeck32/64 using the Hamming weight leakage assumption to extract linearly independent equations in key bits. We have been able to find 32 linearly independent equations in 32 key variables by only considering the second bit from the LSB of the Hamming weight leakage of the internal state on the fourth round of the cipher. This enables our attack to improve previous attacks on Simeck32/64 within side-channel attack model with better time and data complexity of 2 35 and 2 11.29 respectively.

show abstract

Section: Related Workmentioning

confidence: 99%

A Security Analysis of IoT Encryption : Side Channel Cube Attack on SIMECK32/64

Buja¹,

Abdul‐Latip²,

Ahmad³

2018

IJCNC

View full text Add to dashboard Cite

show abstract

“…Sun et al [27] constructed an 8-round higher-order integral distinguisher for RECTANGLE based on division property. Subsequently, Xiang et al [28] found 9-round integral distinguishers of RECTANGLE by using the so-called MILP method. Sasaki and Todo [29] give the complete list of impossible differential characteristics of RECTANGLE starting and ending with 1 active nibble.…”

Section: Introductionmentioning

confidence: 99%

New observation on the key schedule of RECTANGLE

Yan

Luo

Chen

et al. 2019

Sci. China Inf. Sci.

View full text Add to dashboard Cite

We evaluate the security of RECTANGLE from the perspective of actual key information (AKI). Insufficient AKI permits the attackers to deduce some subkey bits from some other subkey bits, thereby lowering the overall attack complexity or getting more attacked rounds. By considering the interaction between the key schedule's diffusion and the round function's diffusion, we find there exists AKI insufficiency in 4 consecutive rounds for RECTANGLE-80 and 6 consecutive rounds for RECTANGLE-128, although the master key bits achieve complete diffusion in 2 and 4 rounds, respectively. With such weakness of the key schedule, we give a generic meet-in-the-middle attack on 12-round reduced RECTANGLE-128 with only 8 known plaintexts. Moreover, we calculate AKI of variants of RECTANGLE as well as PRESENT. Surprisingly we find that both RECTANGLE-128 and PRESENT-128 with no key schedule involve more AKI than the original one. Based on this finding, we slightly modify the key schedule of RECTANGLE-128. Compared with the original one, this new key schedule matches better with the round function in terms of maximizing AKI. Our work adds more insight to the design of block ciphers' key schedule.

show abstract

“…One paradigm for automatic symmetric-key cryptanalysis getting increasing popularity in recent years is to model the problem by means of constraints, which includes the methods based on SAT/SMT (satisfiability modulo theory) [6][7][8], MILP (mixed-integer linear programming) [9][10][11][12][13], and classical constraint programming [14,15]. In this paper, these methods are collectively referred to as the general constraint programming (CP) based approach, or just CP based approach for short.…”

Section: Introductionmentioning

confidence: 99%

Programming the Demirci-Selçuk Meet-in-the-Middle Attack with Constraints

Shi

Sun

Derbez

et al. 2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Cryptanalysis with SAT/SMT, MILP and CP has increased in popularity among symmetric-key cryptanalysts and designers due to its high degree of automation. So far, this approach covers differential, linear, impossible differential, zero-correlation, and integral cryptanalysis. However, the Demirci-Selçuk meet-in-the-middle (DS-MITM) attack is one of the most sophisticated techniques that has not been automated with this approach. By an in-depth study of Derbez and Fouque's work on DS-MITM analysis with dedicated search algorithms, we identify the crux of the problem and present a method for automatic DS-MITM attack based on general constraint programming, which allows the cryptanalysts to state the problem at a high level without having to say how it should be solved. Our method is not only able to enumerate distinguishers but can also partly automate the key-recovery process. This approach makes the DS-MITM cryptanalysis more straightforward and easier to follow, since the resolution of the problem is delegated to offthe-shelf constraint solvers and therefore decoupled from its formulation. We apply the method to SKINNY, TWINE, and LBlock, and we get the currently known best DS-MITM attacks on these ciphers. Moreover, to demonstrate the usefulness of our tool for the block cipher designers, we exhaustively evaluate the security of 8! = 40320 versions of LBlock instantiated with different words permutations in the F functions. It turns out that the permutation used in the original LBlock is one of the 64 permutations showing the strongest resistance against the DS-MITM attack. The whole process is accomplished on a PC in less than 2 hours. The same process is applied to TWINE, and similar results are obtained.

show abstract

Applying MILP Method to Searching Integral Distinguishers Based on Division Property for 6 Lightweight Block Ciphers

Cited by 177 publications

References 23 publications

A Security Analysis of IoT Encryption : Side Channel Cube Attack on SIMECK32/64

A Security Analysis of IoT Encryption : Side Channel Cube Attack on SIMECK32/64

New observation on the key schedule of RECTANGLE

Programming the Demirci-Selçuk Meet-in-the-Middle Attack with Constraints

Contact Info

Product

Resources

About