On Time-Space Lower Bounds for Finding Short Collisions in Sponge Hash Functions

ePrint Report: On Time-Space Lower Bounds for Finding Short Collisions in Sponge Hash Functions

Akshima, Xiaoqi Duan, Siyao Guo, Qipeng Liu

Sponge paradigm, used in the design of SHA-3, is an alternative hashing technique to the popular Merkle-Damgård paradigm. We revisit the problem of finding $B$-block-long collisions in sponge hash functions in the auxiliary-input random permutation model, in which an attacker gets a piece of $S$-bit advice about the random permutation and makes $T$ (forward or inverse) oracle queries to …

block design eprint report functions hash hash functions hashing merkle paradigm popular problem report sha-3 space