Cryptology ePrint Archive: Report 2018/059

New Insights into Divide-and-Conquer Attacks on the Round-Reduced Keccak-MAC

Chen-Dong Ye and Tian Tian

Abstract: 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. In this paper, 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. Furthermore, 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.

Category / Keywords: secret-key cryptography / Keccak-MAC, Divide-and-Conquer Attacks, Cube Attacks

Date: received 14 Jan 2018

Contact author: ye_chendong at 126 com

Available format(s): PDF | BibTeX Citation

Version: 20180116:131158 (All versions of this report)

Short URL: ia.cr/2018/059

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]