The NISQ Complexity of Collision Finding

arXiv:2211.12954v2 Announce Type: replace-cross
Abstract: 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 computing has introduced new challenges since quantum adversaries $\unicode{x2013}$ …

applications arxiv collision complexity cryptographic cryptography cs.cc cs.cr cs.ds find hash hashing inputs making problem property quant-ph security understand value