A second preimage attack on zipper hash. Issue 16 (26th January 2015)

• Record Type: Journal Article
• Authors: Chen, Shiwei; Jin, Chenhui
• Is Part Of: Security and communication networks. Volume 8:Issue 16(2015)
• Page Start: 2860
• Page End: 2866
• Publication Date: 2015-01-26
• Subjects: Computer networks -- Security measures -- Periodicals; Computer security -- Periodicals; Cryptography -- Periodicals; 005.805
• DOI: 10.1002/sec.1210
• Languages: English
• ISSNs: 1939-0114

Abstract

<abstract abstract-type="main"> <title>Abstract</title> <p>The zipper hash utilizes two‐pass hashing to strengthen the iterated hash functions against the generic attack. In this paper, we analyze the features of zipper hash and several existing generic attacks on hash functions. A new tree structure called inverse‐diamond, which starts from one fixed point and ends with many points, is exploited to guarantee that the corresponding message blocks in the two passes be identical. Then, combining the inverse‐diamond structure of depth <italic>l</italic>, with the multicollision of length <italic>n – l</italic> (<italic>n</italic> is bit number of the hash value) and the (<italic>k</italic>, 2<italic><sup>k</sup></italic> + <italic>k</italic> − 1)‐expandable message together, we firstly present a second preimage attack on zipper hash of which the time complexity is about <italic>O</italic>((2 <italic>k</italic> + <italic>n</italic>)2<sup><italic>n</italic>/2</sup> + 2<sup><italic>n</italic> − <italic>k</italic></sup> + (<italic>n</italic> − <italic>l</italic>)2<sup><italic>n</italic> − <italic>l</italic></sup> + 2<sup><italic>l</italic> + 1</sup>), less than <italic>O</italic>(2<italic><sup>n</sup></italic>), and the memory complexity is about <italic>O</italic>(2<sup><italic>k</italic> + 1</sup> + 3*2<italic><sup>l</sup></italic>). Specially, if <italic>k</italic> = <italic>l</italic> = <italic>n</italic>/2, then the time complexity is about <italic>O</italic>(<italic>n</italic>2<sup><italic>n</italic>/2</sup>), and the memory complexity is about <italic>O</italic>(2<sup><italic>n</italic>/2</sup>). Copyright © 2015 John Wiley & Sons, Ltd.</p> </abstract>