Quantum lower bounds for the collision and the element distinctness problems.
Given a function f as an oracle, the collision problem is to find two distinct indexes i and j such that f(i) = f(j), under the promise that such indexes exist. Since the security of many fundamental cryptographic primitives depends on the hardness of finding collisions, our lower bounds provide evi...
| Published in: | Journal of the ACM 51, 4 (2004). |
|---|---|
| Main Author: | |
| Format: | Article |
| Language: | English |
| Subjects: |