On Finding Quantum Multi-collisions

Liu Qipeng, Zhandry Mark. Arxiv 2018

[Paper]    
ARXIV Independent

A $k$-collision for a compressing hash function $H$ is a set of $k$ distinct inputs that all map to the same output. In this work, we show that for any constant $k$, $\mathrm{\Theta }\left(N^{\frac{1}{2}(1-\frac{1}{2^k-1})}\right)$ quantum queries are both necessary and sufficient to achieve a $k$-collision with constant probability. This improves on both the best prior upper bound (Hosoyamada et al., ASIACRYPT 2017) and provides the first non-trivial lower bound, completely resolving the problem.

Similar Work

• Quantum Security Of Hash Functions And Property-preservation Of Iterated Hashing
• Quantum Hashing Via Classical epsilon-universal Hashing Constructions
• A Quantum Algorithm To Locate Unknown Hashgrams
• The Lower Energy Consumption In Cryptocurrency Mining Processes By SHA-256 Quantum Circuit Design Used In Hybrid Computing Domains