期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Related-Key Impossible Diferential Attack on Reduced-Round LBlock 被引量:6
1
作者 温隆 王美琴 赵静远 《Journal of Computer Science & Technology》 SCIE EI CSCD 2014年第1期165-176,共12页
LBlock is a 32-round lightweight block cipher with 64-bit block size and 80-bit key. This paper identifies 16- round related-key impossible differentials of LBlock, which are better than the 15-round related-key impos... LBlock is a 32-round lightweight block cipher with 64-bit block size and 80-bit key. This paper identifies 16- round related-key impossible differentials of LBlock, which are better than the 15-round related-key impossible differentials used in the previous attack. Based on these 16-round related-key impossible differentials, we can attack 23 rounds of LBlock while the previous related-key impossible differential attacks could only work on 22-round LBlock. This makes our attack on LBlock the best attack in terms of the number of attacked rounds. 展开更多
关键词 lightweight block cipher LBlock related-key impossible diferential cryptanalysis
原文传递
New related-key rectangle attacks on reduced AES-192 and AES-256 被引量:1
2
作者 WEI YongZhuang HU YuPu 《Science in China(Series F)》 2009年第4期617-626,共10页
In this paper, we examine the security of reduced AES-192 and AES-256 against related-key rectangle attacks by exploiting the weakness in the AES key schedule. We find the following two new attacks: 9-round reduced A... In this paper, we examine the security of reduced AES-192 and AES-256 against related-key rectangle attacks by exploiting the weakness in the AES key schedule. We find the following two new attacks: 9-round reduced AES-192 with 4 related keys, and 10-round reduced AES-256 with 4 related keys. Our results show that related-key rectangle attack with 4 related keys on 9-round reduced AES-192 requires a data complexity of about 2^101 chosen plaintexts and a time complexity of about 2^174.8 encryptions, and moreover, related-key rectangle attack with 4 related keys on 10-round reduced AES-256 requires a data complexity of about 2^97.5 chosen plaintexts and a time complexity of about 2^254 encryptions. These attacks are the first known attacks on 9-round reduced AES-192 and 10-round reduced AES-256 with only 4 related keys. Furthermore, we give an improvement of the 10-round reduced AES-192 attack presented at FSE2007, which reduces both the data complexity and the time complexity. 展开更多
关键词 block cipher Advanced Encryption Standard related-key rectangle attack time complexity
原文传递
A Related-Key Boomerang Distinguishing Attack of Threefish-256
3
作者 LIU Shusheng WANG Libin GONG Zheng 《Wuhan University Journal of Natural Sciences》 CAS 2012年第5期414-420,共7页
The block cipher Threefish is the main component of Skein, which is based on ARX. Based on the efficient algorithms for calculating the differential of modular addition, we extend local collisions of Threefish-256 to ... The block cipher Threefish is the main component of Skein, which is based on ARX. Based on the efficient algorithms for calculating the differential of modular addition, we extend local collisions of Threefish-256 to more round by using related-key differential of addition in this paper. A related-key boomerang distinguish attack is proposed on 31-round Threefish-256 with a time complexity of 2^(234). 展开更多
关键词 SKEIN differential analysis related-key analysis Boomerang attack
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部