期刊文献+
共找到2篇文章
< 1 >
每页显示 20 50 100
A New Method for Meet-in-the-Middle Attacks on Reduced AES 被引量:3
1
作者 董晓丽 胡予濮 +1 位作者 韦永壮 陈杰 《China Communications》 SCIE CSCD 2011年第2期21-25,共5页
A new 5-round distinguisher of AES with key whitening is presented by using the properties of its round transformation. Based on this distinguisher,we present new meet-in-the-middle attacks on reduced AES considering ... A new 5-round distinguisher of AES with key whitening is presented by using the properties of its round transformation. Based on this distinguisher,we present new meet-in-the-middle attacks on reduced AES considering the key schedule and the time-memory tradeoff approach. New attacks improve the best known meet-in-the-middle attacks on reduced AES presented at FSE2008.We reduce the time complexity of attacks on 7-round AES-192 and 8-round AES-256 by a factor of at least 28. Moreover,the distinguisher can be exploited to develop the attack on 8-round AES-192. 展开更多
关键词 AES RIJNDAEL CRYPTANALYSIS meet-in-the-middle attack
下载PDF
Differential Fault Analysis and Meet-in-the-Middle Attack on the Block Cipher KATAN32 被引量:1
2
作者 张文英 刘枫 +1 位作者 刘宣 孟帅 《Journal of Shanghai Jiaotong university(Science)》 EI 2013年第2期147-152,共6页
We investigate the lightweight block cipher KATAN family which consists of three variants with 32, 48 and 64-bit block sizes, called KATAN32, KATAN48 and KATAN64 respectively. However, three variants all have the same... We investigate the lightweight block cipher KATAN family which consists of three variants with 32, 48 and 64-bit block sizes, called KATAN32, KATAN48 and KATAN64 respectively. However, three variants all have the same key length of 80 bits. On the basis of the bit-oriented faulty model and the differential analysis principle, we describe the attack that combines differential fault attack with the meet-in-the-middle (MITM) attack on the KATAN32. More precisely, inducing a fault at a bit, we can recover some linear differential fault equations on the key bits. During solving equations, without the help of computer, we need only algebraic deduction to obtain relations of some key bits. The complexity in this process is neglectable. The secret key of the full cipher can be recovered faster than exhaustive search for all three block sizes in the KATAN family. Our result describes that KATAN32 is vulnerable. 展开更多
关键词 KATAN32 DIFFERENTIAL FAULT analysis meet-in-the-middle (MITM) attack BLOCK CIPHER LIGHTWEIGHT CIPHER
原文传递
上一页 1 下一页 到第
使用帮助 返回顶部