Cites work
- 4-round Luby-Rackoff construction is a qPRP
- A new quantum lower bound method, with applications to direct product theorems and time-space tradeoffs
- Adaptive versus static multi-oracle algorithms, and quantum security of a split-key PRF
- An optimal oracle separation of classical and quantum hybrid schemes
- Complexity measures and decision tree complexity: a survey.
- Computations with greater Quantum depth are strictly more powerful (relative to an oracle)
- How to record quantum queries, and applications to quantum indifferentiability
- scientific article; zbMATH DE number 7759460 (Why is no real title available?)
- scientific article; zbMATH DE number 7716601 (Why is no real title available?)
- Impossibility of a Quantum Speed-Up with a Faulty Oracle
- Impossibility of succinct quantum proofs for collision-freeness
- On finding quantum multi-collisions
- On the compressed-oracle technique, and post-quantum security of proofs of sequential work
- On the need for large quantum depth
- On the Power of Quantum Computation
- On the security of proofs of sequential work in a post-quantum world
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Post-quantum security of the Even-Mansour cipher
- Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs
- Quantum Complexity Theory
- Quantum cryptanalysis of hash and claw-free functions
- Quantum key-length extension
- Quantum lower bounds by polynomials
- Quantum lower bounds by quantum arguments
- Quantum lower bounds for approximate counting via Laurent polynomials
- Quantum lower bounds for the collision and the element distinctness problems
- Quantum random oracle model with auxiliary input
- Quantum security proofs using semi-classical oracles
- Quantum-access-secure message authentication via blind-unforgeability
- Rapid solution of problems by quantum computation
- Revisiting post-quantum Fiat-Shamir
- Succinct arguments in the quantum random oracle model
- Tighter proofs of CCA security in the quantum random oracle model
- Unifying presampling via concentration bounds
- Universal Arguments and their Applications
Cited in
(5)
This page was built for publication: The NISQ complexity of collision finding
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6637517)
