Research On Analysis And Application Of Cryptographic Core Components

The core components of the cryptographic algorithm determine the security of the cryptographic algorithm.The core components of the block cipher algorithm include the S-box and the Permutation layer.The core components of the stream cipher algorithm are the linear feedback shift register and the nonlinear feedback shift register.By analyzing the nature of these core components of cryptographic algorithms,the security of cryptographic algorithms can be effectively evaluated.How to analyze the nature and verify the security of the key components of cryptographic algorithms has always been the core issue of cryptography research.With the development of the Internet,lightweight cryptographic algorithms have developed rapidly due to the adaptation to resource-constrained environments.This paper focuses on the analysis of several lightweight cryptographic algorithms that have been proposed in recent years,utilizes corresponding analysis methods to analyze its core components,discovers their properties and applies them to the corresponding analysis to improve attack efficiency.The main work is as follows:1)Based on the structural characteristics of the GRANULE and MANTRA,the S-box differential characteristics are obtained by analyzing the S-box differential distribution table.And then use the meet-in-the-middle technique respectively to traverse the differential paths obtained from the encryption/decryption direction,and select the optimal differential path with probability 0.The analysis results show that there are 144different 7-round impossible differential distinguishers in the GRANULE algorithm,and there are 52 different 9-round impossible differential distinguishers in the MANTRA algorithm.Compared with the existing results,the newly discovered distinguisher rounds are currently the highest.2)Based on the division cube attacks of the Trivi A-sc algorithm,this paper constructs the MILP model of the Trivi A-sc algorithm,and then searches through the solver.The experimental results show that after the 950,960 and 970 rounds of initialization,the sizes of cubes are 39,42 and 44 which provide newly result for the cube analysis of the Trivi A-sc algorithm.3)Based on the structural characteristics of the BORON,a new MILP model is constructed and solved to obtain 160 different 6-round impossible differential distinguishers.On this basis,the input and output differential characteristics of the S-box are used to expand two rounds respectively,and the input and output differential probability of the S-box are used to provide a key recovery method of 10-rounds of impossible differential cryptanalysis.This attack requires a data complexity of about 2^43.52chosen plaintexts,a time complexity of about 2^62.08 10-round encryptions,and a memory complexity of 2^44.52 data blocks.