Improved Davies-Murphy's attack on des revisited

ISCAS OpenIR

	Improved Davies-Murphy's attack on des revisited
	Lu, Yi (1); Desmedt, Yvo (2); Lu, Y.(luyi666@gmail.com)
	2014
会议名称	6th International Symposium on Foundations and Practice of Security, FPS 2013
页码	264-271
会议日期	October 21, 2013 - October 22, 2013
会议地点	La Rochelle, France
收录类别	EI
出版地	Springer Verlag, Tiergartenstrasse 17, Heidelberg, D-69121, Germany
ISSN	3029743
ISBN	9783319053011
部门归属	(1) National Engineering Research Center of Fundamental Software, Institute of Software, Chinese Academy of Sciences, Beijing, China; (2) University of Texas at Dallas, Richardson TX, United States; (3) University College London, London, United Kingdom
摘要	DES is a famous 64-bit block cipher with balanced Feistel structure. It consists of 16 rounds. The key has 56 bits and the round key has 48 bits. Two major cryptanalysis techniques (namely, linear cryptanalysis and differential cryptanalysis) were notably developed and successfully applied to the full 16-round DES in the early 1990's. Davies-Murphy's attack can be seen as a special linear attack, which was developed before invention of linear cryptanalysis. It was improved by Biham and Biryukov and most recently by Jacques and Muller. In this paper, we revisit the recent improved Davies-Murphy's attack by Jacques and Muller from an algorithmic point of view. Based on Matsui's algorithm 2, we give an improved attack algorithm. Our improved attack algorithm works in time with memory. In contrast, Jacques-Muller's attack takes time and memory. It seems that our results of the time and memory complexities are optimal, due to the use of Walsh transform. Meanwhile, we generalize and further improve the results of the improved Matsui's algorithm 2 for the case that the subkeys are XORed into the round function. © 2014 Springer International Publishing Switzerland.; DES is a famous 64-bit block cipher with balanced Feistel structure. It consists of 16 rounds. The key has 56 bits and the round key has 48 bits. Two major cryptanalysis techniques (namely, linear cryptanalysis and differential cryptanalysis) were notably developed and successfully applied to the full 16-round DES in the early 1990's. Davies-Murphy's attack can be seen as a special linear attack, which was developed before invention of linear cryptanalysis. It was improved by Biham and Biryukov and most recently by Jacques and Muller. In this paper, we revisit the recent improved Davies-Murphy's attack by Jacques and Muller from an algorithmic point of view. Based on Matsui's algorithm 2, we give an improved attack algorithm. Our improved attack algorithm works in time with memory. In contrast, Jacques-Muller's attack takes time and memory. It seems that our results of the time and memory complexities are optimal, due to the use of Walsh transform. Meanwhile, we generalize and further improve the results of the improved Matsui's algorithm 2 for the case that the subkeys are XORed into the round function. © 2014 Springer International Publishing Switzerland.
语种	英语
内容类型	会议论文
URI标识	http://ir.iscas.ac.cn/handle/311060/16608
专题	中国科学院软件研究所
通讯作者	Lu, Y.(luyi666@gmail.com)
推荐引用方式 GB/T 7714	Lu, Yi ,Desmedt, Yvo ,Lu, Y.. Improved Davies-Murphy's attack on des revisited[C]. Springer Verlag, Tiergartenstrasse 17, Heidelberg, D-69121, Germany,2014:264-271.