Evolutionary cryptography against multidimensional linear cryptanalysis  

作　　者：ZHANG HuanGuo LI ChunLei TANG Ming 

机构地区：[1]School of Computer, Wuhan University, Wuhan 430079, China [2]Key Laboratory of Aerospace Information Security and Trusted Computing of Ministry of Education of China, Wuhan University, Wuhan 430079, China

出　　处：《Science China(Information Sciences)》2011年第12期2565-2577,共13页中国科学（信息科学）（英文版）

基　　金：supported by the National Natural Science Foundation of China(Grant Nos.69973034,90104005,60373087,60673071,60970115,60970116,91018008,60970006,61003267)

摘　　要：The evolutionary cryptosystem is a new cryptosystem proposed by a Chinese researcher recently. This paper studies its security level resisting against multidimensional linear cryptanalysis in this paper. It is shown that the evolutionary cryptosystem possesses higher resistance than its initial fixed cryptosystem does for resisting against multidimensional linear cryptanalysis. Multidimensional generalizations of Matsui’s Algorithm 1 and Algorithm 2 based on log-likelihood ratio （LLR） statistics are introduced. By the relationship among the data complexity N , the bit advantage a and the success rate P S of these two multidimensional generalized algorithms, it is proven that more data is needed for attacking the evolutionary cryptosystem than that is needed for attacking its initial fixed cryptosystem when the bit advantage and success rate are identical. Moreover, it is shown that both time complexity and memory complexity for attacking the evolutionary cryptosystem are higher than that of attacking its initial fixed cryptosystem with the same data complexity. The research indicates that the evolutionary cryptosystem is more robust than its initial fixed cryptosystem against the multidimensional linear cryptanalysis.The evolutionary cryptosystem is a new cryptosystem proposed by a Chinese researcher recently. This paper studies its security level resisting against multidimensional linear cryptanalysis in this paper. It is shown that the evolutionary cryptosystem possesses higher resistance than its initial fixed cryptosystem does for resisting against multidimensional linear cryptanalysis. Multidimensional generalizations of Matsui’s Algorithm 1 and Algorithm 2 based on log-likelihood ratio （LLR） statistics are introduced. By the relationship among the data complexity N , the bit advantage a and the success rate P S of these two multidimensional generalized algorithms, it is proven that more data is needed for attacking the evolutionary cryptosystem than that is needed for attacking its initial fixed cryptosystem when the bit advantage and success rate are identical. Moreover, it is shown that both time complexity and memory complexity for attacking the evolutionary cryptosystem are higher than that of attacking its initial fixed cryptosystem with the same data complexity. The research indicates that the evolutionary cryptosystem is more robust than its initial fixed cryptosystem against the multidimensional linear cryptanalysis.

关 键 词：information security CRYPTOLOGY evolutionary cryptosystem CRYPTANALYSIS multidimensional linear cryptanalysis 

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