Cryptanalysis of DBST, a lightweight block cipher  

作　　者：Sadegh SADEGHI Nasour BAGHERI 

机构地区：[1]Department of Mathematics,Institute for Advanced Studies in Basic Sciences(IASBS),Zanjan 45137-66731,Iran [2]Research Center for Basic Sciences and Modern Technologies(RBST),Institute for Advanced Studies in Basic Sciences(IASBS),Zanjan 45137-66731,Iran [3]Electrical Engineering Department,Shahid Rajaee Teacher Training University,Tehran 16788-15811,Iran [4]School of Computer Science(SCS),Institute for Research in Fundamental Sciences(IPM),Tehran 19395-5531,Iran

出　　处：《Frontiers of Computer Science》2024年第4期219-221,共3页中国计算机科学前沿（英文版）

基　　金：Shahid Rajaee Teacher Training University(Grant No.4968).

摘　　要：1 Introduction Conventional cryptographic primitives are not suitable for resource-constrained environments.Consequently,numerous lightweight primitives have been proposed over the past decade,specifically tailored for such applications.However,such ciphers would not be used in a real-world application unless they were thoroughly tested for security against existing attacks.In this direction,DBST[1]cipher has been recently proposed by Yan et al.To balance security,cost,and efficiency,DBST has implemented a novel 4-branch generalized Feistel variant structure.Within this structure,a 2-branch XOR operation has been incorporated in the middle section,establishing interconnections between all branches.On the other hand,by leveraging the bit-slice technique and subkeys,the algorithm introduces an innovative approach to constructing a dynamic S-box structure.The designers of DBST cipher have extensively investigated its resistance to known attacks such as linear and differential cryptanalysis,as well as impossible differential cryptanalysis,among others.Among them,the objective of differential cryptanalysis[2]is to identify high-probability characteristics in the plaintext that are transmitted to the ciphertext,known as distinguishers.

关 键 词：structure. PRIMITIVE branch 

分 类 号：TN918.4[电子电信—通信与信息系统]