分组密码中Feistel结构算法的安全性分析-密码学专业论文.docx

Ab Abstract 6Ab 6 Abstract 万方数据 万方数据 万方数据 万方数据 Abstract Block Cipher is widely used in data encryption of message communication. It is the fundamental algorithm and theory of cryptography, and also the rationale and component of designing other ciphers. The discussion on security of block cipher mainly contains differential cryptanalysis, linear cryptanalysis and exhaustive attack. As new ciphers appear constantly, the design and analysis on a class of Feistel cipher developes towards diversified directions, to which the analysis of security has great practical significance. The main works of this paper are as follows: Firstly, we summarize the basis theory of block cipher designing and analysis methods we have known, and mainly introduce Feistel structure. Secondly, based on the research and recognition of the preceding knowledge, this paper introduces a new chosen text attack, the impossible differential-linear attack, on iterated cryptosystem. The attack is a general approach, which can be implemented by constructing a distinguisher catenating the impossible differential and the linear approximation together. It can be applied to the Feistel structure effectively. Then, we introduce CLEFIA, a representative cipher of Feistel families, and present a 11-round attack on it with differential-linear cryptanalysis. The data complexity is 2116.52 ， and we recover 96-bit keys in total. After that, the paper focuses on analyzing CLEFIA-128 with impossible differential-linear attack we proposed. The attack is efficient for 16-round CLEFIA with whitening keys. At first we construct a 13-round impossible differential-linear distinguisher. Based on the distinguisher, we present an effective attack on CLEFIA-128 with data complexity of 2122.73 , recovering 96-bit subkeys in total. It is the best result at present. At last, some other results during the research are introduced, including another 13-round impossible differential-linear distinguisher, another 16-round attack