Second Preimage Analysis of Whirlwind

被引：6

作者：

AlTawy, Riham ^{[1
]}

Youssef, Amr M. ^{[1
]}

机构：

[1] Concordia Univ, Concordia Inst Informat Syst Engn, Montreal, PQ, Canada

来源：

INFORMATION SECURITY AND CRYPTOLOGY (INSCRYPT 2014) | 2015年 / 8957卷

关键词：

Cryptanalysis; Hash functions; Meet in the middle; Second preimage attack; Whirlwind; ATTACKS; MD4; WHIRLPOOL;

D O I：

10.1007/978-3-319-16745-9_17

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Whirlwind is a keyless AES-like hash function that adopts the Sponge model. According to its designers, the function is designed to resist most of the recent cryptanalytic attacks. In this paper, we evaluate the second preimage resistance of the Whirlwind hash function. More precisely, we apply a meet in the middle preimage attack on the compression function which allows us to obtain a 5-round pseudo preimage for a given compression function output with time complexity of 2(385) and memory complexity of 2(128). We also employ a guess and determine approach to extend the attack to 6 rounds with time and memory complexities of 2(496) and 2(112), respectively. Finally, by adopting another meet in the middle attack, we are able to generate n-block message second preimages of the 5 and 6-round reduced hash function with time complexity of 2(449) and 2(505) and memory complexity of 2(128) and 2(112), respectively.

引用

页码：311 / 328

页数：18

共 29 条

[1]

AlTawy R, 2014, LECT NOTES COMPUT SC, V8469, P109

[2]

[Anonymous], 2007, FED REG

[3]

Aoki K, 2009, LECT NOTES COMPUT SC, V5381, P103, DOI 10.1007/978-3-642-04159-4_7

[4]

Aoki K, 2009, LECT NOTES COMPUT SC, V5912, P578, DOI 10.1007/978-3-642-10366-7_34

[5]

Aoki K, 2009, LECT NOTES COMPUT SC, V5677, P70, DOI 10.1007/978-3-642-03356-8_5

[6]

Barreto P.S, 2000, NESSIE UNPUB

[7] Whirlwind: a new cryptographic hash function [J].

Barreto, Paulo ;

Nikov, Ventzislav ;

Nikova, Svetla ;

Rijmen, Vincent ;

Tischhauser, Elmar .

DESIGNS CODES AND CRYPTOGRAPHY, 2010, 56 (2-3) :141-162

[8]

Bertoni G, 2008, LECT NOTES COMPUT SC, V4965, P181

[9]

Daemen Joan, 2020, Information Security and Cryptography, V2nd

[10]

Gauravaram P., 2008, GROSTL SHA 3 CANDIDA

← 1 2 3 →