The NISQ Complexity of Collision Finding

ePrint Report: The NISQ Complexity of Collision Finding

Yassine Hamoudi, Qipeng Liu, Makrand Sinha

Collision-resistant hashing, a fundamental primitive in modern cryptography, ensures that there is no efficient way to find distinct inputs that produce the same hash value. This property underpins the security of various cryptographic applications, making it crucial to understand its complexity. The complexity of this problem is well-understood in the classical setting and $\Theta(N^{1/2})$ queries are needed to find a collision. However, the advent of quantum …

applications collision complexity cryptographic cryptography eprint report find hash hashing inputs making property report security understand value