Construction of equivalent linear trails and multiple linear attack on reduced-round GIFT-64

Cui, Yaxin; Xu, Hong; Tan, Lin; Chen, Huajin; Qi, Wei

doi:10.1007/s13389-022-00298-7

Cited by 1 publication

(1 citation statement)

References 23 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It was applied in determining the least amount of active Sboxes in differential and linear attacks. Sun [21], [22] broaden their framework and gave an MILP model suitable for bit-oriented ciphers, which can give a more precise assessment of the resilience of ciphers against various at-tacks, for example, a linear analysis using MILP is presented to attack the block cipher GIFT [23]. Recently, a method grounded in Boolean satisfiability problem (SAT) [24] is proposed to assess the security of symmetric-key primitive designs.…”

Section: Introductionmentioning

confidence: 99%

SAT-Based Automatic Searching for Differential and Linear Trails: Applying to CRAX

Han,

Wang,

Niu

et al. 2024

Chinese J. Elect.

View full text Add to dashboard Cite

Boolean satisfiability problem (SAT) is now widely applied in differential cryptanalysis and linear cryptanalysis for various cipher algorithms. It generated many excellent results for some ciphers, for example, Salsa20. In this research, we study the differential and linear propagations through the operations of addition, rotation and XOR (ARX), and construct the SAT models. We apply the models to CRAX to search differential trails and linear trails automatically. In this sense, our contribution can be broadly divided into two parts. We give the bounds for differential and linear cryptanalysis of Alzette both up to 12 steps, by which we present a 3-round differential attack and a 3-round linear attack for CRAX. We construct a 4-round key-recovery attack for CRAX with time complexity times of 4-round encryption and data complexity .

show abstract

Section: Introductionmentioning

confidence: 99%