首页|New Insights into Divide-and-Conquer Attacks on the Round-Reduced Keccak-MAC
New Insights into Divide-and-Conquer Attacks on the Round-Reduced Keccak-MAC
扫码查看
点击上方二维码区域，可以放大扫码查看
原文链接
NETL
NSTL
万方数据
维普
Keccak is the final winner of SHA-3 competition and it can be used as message authentic codes as well. The basic and balanced divide-and-conquer attacks on Keccak-MAC were proposed by Dinur et al. at Eurocrypt 2015. The idea of cube attacks is used in the two attacks to divide key bits into small portions. By carefully analysing the mappings used in Keccak-MAC, it is found that some cube variables could divide key bits into smaller portions and so better divide-and-conquer attacks are obtained. In order to evaluate the resistance of Keccak-MAC against divide-and-conquer attacks based on cubes, we theoretically analyse the lower bounds of the complexities of divide-and-conquer attacks. It is shown that the lower bounds of the complexities are still not better than those of the conditional cube tester proposed by Senyang Huang et al.. This indicates that Keccak-MAC can resist the divide-and-conquer attack better than the conditional cube tester. We hope that these techniques still could provide some new insights on the future cryptanalysis of Keccak.
Keccak-MACDivide-and-conquer attacksCube attacks
YE Chendong、TIAN Tian
展开 >
National Digital Switching System Engineering and Technological Research Center, Zhengzhou 450001 China
This work is supported by the National Natural Science Foundation of China
NETL
NSTL
万方数据
维普
