Quantum lower bound for the collision problem with small range
From MaRDI portal
Recommendations
Cited in
(24)- Quantum collision-finding in non-uniform random functions
- Element distinctness revisited
- Quantum algorithm for the multicollision problem
- Oracle separations between quantum and non-interactive zero-knowledge classes
- Quantum algorithm to find invariant linear structure of MD hash functions
- The quantum query complexity of the abelian hidden subgroup problem
- Polynomial degree vs. quantum query complexity
- Quantum meets fine-grained complexity: sublinear time quantum algorithms for string problems
- Impossibility of succinct quantum proofs for collision-freeness
- Quantum adversary lower bound for element distinctness with small range
- Quantum lower bounds for the collision and the element distinctness problems
- Provably secure key establishment against quantum adversaries
- The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound
- A note on the quantum query complexity of permutation symmetric functions
- On the power of statistical zero knowledge
- Algorithmic Polynomials
- Conditional disclosure of secrets: amplification, closure, amortization, lower-bounds, and separations
- A note about claw function with a small range
- Near-optimal quantum algorithms for string problems
- scientific article; zbMATH DE number 7716601 (Why is no real title available?)
- Symmetries, graph properties, and quantum speedups
- On quantum query complexities of collision-finding in non-uniform random functions
- Quantum algorithms for Hopcroft's problem
- Uniformity testing when you have the source code
This page was built for publication: Quantum lower bound for the collision problem with small range
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3002755)
