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

扫码查看

原文链接

万方数据

外文摘要：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 289 times of 4-round encryption and data complexity 225.

外文关键词：

Differential cryptanalysisLinear cryptanalysisBoolean satisfiability problemCRAX

作者：

Yiyi HAN、Caibing WANG、Zhongfeng NIU、Lei HU

展开 >

作者单位：

State Key Laboratory of Information Security,Institute of Information Engineering,Chinese Academy of Sciences,Beijing 100195,China

School of Cyber Security,University of Chinese Academy of Sciences,Beijing 100049,China

基金：

National Key R&D Program of ChinaNatural Science Foundation of ChinaChinese Major Program of National Cryptography Development Foundation

项目编号：

2018YFA070470461772519MMJJ20180102

出版年：

2024

DOI：

10.23919/cje.2022.00.313

电子学报(英文)

CSTPCDEI

ISSN：1022-4653

年,卷(期)：2024.33(1)

参考文献量42