1997/07/04 by Dong Pyo, Jin-Soo Kim, Chi, Dong Pyo +1
Computer Science · #Quantum Computing Algorithms and Architecture #Quantum Information and Cryptography #Cryptography and Data Security
paper · pdf · doi:10.48550/arxiv.quant-ph/9707011
In this paper, we give a quantum algorithm which solves collision problem in an expected polynomial time. Especially, when the function is two-to-one, we present a quantum algorithm which can find a collision with certainty in a worst-case polynomial time. We also give a quantum algorithm which solves claw problem with certainty in a worst-case polynomial time.