Paper 2017/534
Functional Graph Revisited: Updates on (Second) Preimage Attacks on Hash Combiners
Zhenzhen Bao and Lei Wang and Jian Guo and Dawu Gu
Abstract
In this paper, we study functional-graph-based (second) preimage attacks against hash combiners. Our contributions are threefold: \begin{itemize} \item in EUROCRYPT~2016, Dinur proposes generic (second) preimage attacks on the concatenation combiner and the XOR combiner using a new and essential observation on functional graph, which is experimentally verified but the proof is incomplete. Our first contribution is to provide a proof for Dinur's observation; \item we find improved preimage attack against the XOR combiner with a complexity of $2^{5n/8}$, while the previous best-known complexity is $2^{2n/3}$; \item we find the first generic second-preimage attack on Zipper hash with an optimal complexity of $2^{3n/5}$. \end{itemize}
Note: Minor revisited
Metadata
- Available format(s)
- Publication info
- Published by the IACR in CRYPTO 2017
- Keywords
- Hash CombinerFunctional GraphXOR CombinerZipper Hash(Second) Preimage Attack
- Contact author(s)
- wanglei_hb @ sjtu edu cn
- History
- 2017-08-19: revised
- 2017-06-07: received
- See all versions
- Short URL
- https://ia.cr/2017/534
- License
-
CC BY