Fully Automated Differential-Linear Attacks Against ARX Ciphers

Bellini, Emanuele; Gerault, David; Grados, Juan; Makarim, Rusydi H.; Peyrin, Thomas

doi:10.1007/978-3-031-30872-7_10

Cited by 6 publications

(8 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our Contribution. The new MILP/MIQCP model to find DL distinguishers for ARX ciphers was given by Bellini et al [15], but the MILP/MIQCP techniques could not be applied to SIMON-like ciphers. Inspired by this, we propose continuous difference propagation of AND operation for the first time.…”

Section: Related Workmentioning

confidence: 99%

“…Inspired by Coutinho's idea, Bellini et al [15] constructed continuous functions for the difference propagation of ARX operations. For instance, assume a; ð bÞ and a 0 ;…”

Section: Notations and Preliminariesmentioning

confidence: 99%

“…However, there is no effective method that can automatically search for good DL distinguishers in the above researches on DL cryptanalysis. At CT-RSA 2023, Bellini et al [15] presented a fully automatic method of searching for DL distinguishers for ARX ciphers by using Mixed-Integer Linear Programing (MILP) and Mixed-Integer Quadratic Constraint Programing (MIQCP) techniques. They improved the correlations of the best 9 and 10-round DL distinguishers on Speck32/64.…”

Section: Introductionmentioning

confidence: 99%

“…SIMON-like ciphers also include XOR operation and left rotation operation. Bellini et al [15] showed the constraints of them.…”

mentioning

confidence: 99%

“…Constraints of Left Rotation Operation [15]. For every left rotation operation with input a 2 B n and output c 2 B n , we have n constraints:…”

mentioning

confidence: 99%

See 4 more Smart Citations

MILP/MIQCP-Based Fully Automatic Method of Searching for Differential-Linear Distinguishers for SIMON-Like Ciphers

Zhou,

Wang,

2024

IET Information Security

View full text Add to dashboard Cite

Differential-linear (DL) cryptanalysis is an important cryptanalytic method in cryptography and has received extensive attention from the cryptography community since its proposal by Langford and Hellman in 1994. At CT-RSA 2023, Bellini et al. introduced continuous difference propagations of XOR, rotation, and modulo-addition operations and proposed a fully automatic method using Mixed-Integer Linear Programing (MILP) and Mixed-Integer Quadratic Constraint Programing (MIQCP) techniques to search for DL distinguishers of Addition-Rotation-XOR (ARX) ciphers. In this paper, we propose continuous difference propagation of AND operation and construct an MILP/MIQCP-based fully automatic model of searching for DL distinguishers of SIMON-like ciphers. We apply the fully automatic model to all versions of SIMON and SIMECK. As a result, for SIMON, we find 13 and 14-round DL distinguishers of SIMON32, 15, 16, and 17-round DL distinguishers of SIMON48, 20-round DL distinguishers of SIMON64, 25 and 26-round DL distinguishers of SIMON96, 31 and 32-round DL distinguishers of SIMON128. For SIMECK, we find 14-round DL distinguishers of SIMECK32, 17 and 18-round DL distinguishers of SIMECK48, 22, 23, 24, and 25-round DL distinguishers of SIMECK64. As far as we know, our results are currently the best.

show abstract

Section: Related Workmentioning

confidence: 99%

“…Inspired by Coutinho's idea, Bellini et al [15] constructed continuous functions for the difference propagation of ARX operations. For instance, assume a; ð bÞ and a 0 ;…”

Section: Notations and Preliminariesmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

“…SIMON-like ciphers also include XOR operation and left rotation operation. Bellini et al [15] showed the constraints of them.…”

mentioning

confidence: 99%

“…Constraints of Left Rotation Operation [15]. For every left rotation operation with input a 2 B n and output c 2 B n , we have n constraints:…”

mentioning

confidence: 99%

See 3 more Smart Citations