Finding ordinary cube variables for Keccak-MAC with greedy algorithm

Fukang Liu*, Zhenfu Cao, Gaoli Wang

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationAdvances in Information and Computer Security - 14th International Workshop on Security, IWSEC 2019, Proceedings
EditorsNuttapong Attrapadung, Takeshi Yagi
PublisherSpringer Verlag
Pages287-305
Number of pages19
ISBN (Print)9783030268336
DOIs
StatePublished - 2019
Event14th International Workshop on Security, IWSEC 2019 - Tokyo, Japan
Duration: 28 Aug 201930 Aug 2019

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume11689 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference14th International Workshop on Security, IWSEC 2019
Country/TerritoryJapan
CityTokyo
Period28/08/1930/08/19

Keywords

  • Conditional cube attack
  • Hash function
  • Keccak
  • Keccak-MAC
  • Ordinary cube variables

Fingerprint

Dive into the research topics of 'Finding ordinary cube variables for Keccak-MAC with greedy algorithm'. Together they form a unique fingerprint.

Cite this