跳到主要导航 跳到搜索 跳到主要内容

Finding ordinary cube variables for Keccak-MAC with greedy algorithm

  • East China Normal University

科研成果: 书/报告/会议事项章节会议稿件同行评审

摘要

In this paper, we introduce an alternative method to find ordinary cube variables for Keccak-MAC by making full use of the key-independent bit conditions. First, we select some potential candidates for ordinary cube variables by properly adding key-independent bit conditions, which do not multiply with the chosen conditional cube variables in the first two rounds. Then, we carefully determine the ordinary cube variables from the candidates to establish the conditional cube tester. Finally, based on our new method to recover the 128-bit key, the conditional cube attack on 7-round Keccak-MAC-128/256/384 is improved to 271 and 6-round Keccak-MAC-512 can be attacked with at most 240 calls to 6-round Keccak internal permutation. It should be emphasized that our new approach does not require sophisticated modeling. As far as we know, it is the first time to clearly reveal how to utilize the key-independent bit conditions to select ordinary cube variables for Keccak-MAC.

源语言英语
主期刊名Advances in Information and Computer Security - 14th International Workshop on Security, IWSEC 2019, Proceedings
编辑Nuttapong Attrapadung, Takeshi Yagi
出版商Springer Verlag
287-305
页数19
ISBN(印刷版)9783030268336
DOI
出版状态已出版 - 2019
活动14th International Workshop on Security, IWSEC 2019 - Tokyo, 日本
期限: 28 8月 201930 8月 2019

出版系列

姓名Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
11689 LNCS
ISSN(印刷版)0302-9743
ISSN(电子版)1611-3349

会议

会议14th International Workshop on Security, IWSEC 2019
国家/地区日本
Tokyo
时期28/08/1930/08/19

指纹

探究 'Finding ordinary cube variables for Keccak-MAC with greedy algorithm' 的科研主题。它们共同构成独一无二的指纹。

引用此