On the public citation graph
Quantum Time–Space Tradeoff for Finding Multiple Collision Pairs
0 signed · 51 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1002/(sici)1521-3978(199806)46:4/5<493::aid-prop493>3.0.co;2-popenalex-snapshot
Tight Bounds on Quantum Searching
inferredcites →https://doi.org/10.1006/jcss.2002.1826openalex-snapshot
Quantum Lower Bounds by Quantum Arguments
inferredcites →https://doi.org/10.1007/3-540-45708-9_19openalex-snapshot
A Generalized Birthday Problem
inferredcites →https://doi.org/10.1007/978-3-030-03807-6_1openalex-snapshot
Provable Time-Memory Trade-Offs: Symmetric Cryptography Against Memory-Bounded Adversaries
inferredcites →https://doi.org/10.1007/978-3-030-10970-7_15openalex-snapshot
On the Cost of Computing Isogenies Between Supersingular Elliptic Curves
inferredcites →https://doi.org/10.1007/978-3-030-17653-2_16openalex-snapshot
Tight Time-Memory Trade-Offs for Symmetric Encryption
inferredcites →https://doi.org/10.1007/978-3-030-17659-4_7openalex-snapshot
On Finding Quantum Multi-collisions
inferredcites →https://doi.org/10.1007/978-3-030-26951-7_9openalex-snapshot
How to Record Quantum Queries, and Applications to Quantum Indifferentiability
inferredcites →https://doi.org/10.1007/978-3-030-34578-5_6openalex-snapshot
4-Round Luby-Rackoff Construction is a qPRP
inferredcites →https://doi.org/10.1007/978-3-030-35199-1_9openalex-snapshot
Improved Low-Memory Subset Sum and LPN Algorithms via Multiple Collisions
inferredcites →https://doi.org/10.1007/978-3-030-36033-7_1openalex-snapshot
Succinct Arguments in the Quantum Random Oracle Model
inferredcites →https://doi.org/10.1007/978-3-030-45721-1_15openalex-snapshot
Tight Time-Space Lower Bounds for Finding Multiple Collision Pairs and Their Applications
inferredcites →https://doi.org/10.1007/978-3-030-56784-2_5openalex-snapshot
The Memory-Tightness of Authenticated Encryption
inferredcites →https://doi.org/10.1007/978-3-642-10366-7_21openalex-snapshot
Improved Generic Algorithms for 3-Collisions
inferredcites →https://doi.org/10.1007/978-3-642-32009-5_42openalex-snapshot
Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
inferredcites →https://doi.org/10.1007/978-3-662-49384-7_15openalex-snapshot
Mitigating Multi-target Attacks in Hash-Based Signatures
inferredcites →https://doi.org/10.1007/bf01933667openalex-snapshot
A monte carlo method for factorization
inferredcites →https://doi.org/10.1007/bfb0054319openalex-snapshot
Quantum cryptanalysis of hash and claw-free functions
inferredcites →https://doi.org/10.1007/pl00003816openalex-snapshot
Parallel Collision Search with Cryptanalytic Applications
inferredcites →https://doi.org/10.1007/s00145-003-0213-5openalex-snapshot
The Full Cost of Cryptanalytic Attacks
inferredcites →https://doi.org/10.1007/s00453-007-9022-9openalex-snapshot
A New Quantum Lower Bound Method, with Applications to Direct Product Theorems and Time-Space Tradeoffs
inferredcites →https://doi.org/10.1016/0022-0000(81)90037-4openalex-snapshot
A time-space tradeoff for sorting on non-oblivious machines
inferredcites →https://doi.org/10.1016/0304-3975(93)90257-topenalex-snapshot
The computational complexity of universal hashing
inferredcites →https://doi.org/10.1016/s0304-3975(01)00144-xopenalex-snapshot
Complexity measures and decision tree complexity: a survey
inferredcites →https://doi.org/10.1109/ccc.2008.9openalex-snapshot
The Multiplicative Quantum Adversary
inferredcites →https://doi.org/10.1109/fscs.1990.89561openalex-snapshot
A time-space tradeoff for Boolean matrix multiplication
inferredcites →https://doi.org/10.1112/s1461157016000206openalex-snapshot
Reduced memory meet-in-the-middle attack against the NTRU private key
inferredcites →https://doi.org/10.1137/0216007openalex-snapshot
A Time-Space Tradeoff for Element Distinctness
inferredcites →https://doi.org/10.1137/0220017openalex-snapshot
A general Sequential Time-Space Tradeoff for Finding Unique Elements
inferredcites →https://doi.org/10.1137/05063235xopenalex-snapshot
Quantum and Classical Strong Direct Product Theorems and Optimal Time‐Space Tradeoffs
inferredcites →https://doi.org/10.1137/s0097539705447311openalex-snapshot
Quantum Walk Algorithm for Element Distinctness
inferredcites →https://doi.org/10.1137/s0097539788148959openalex-snapshot
Near-Optimal Time-Space Tradeoff for Element Distinctness
inferredcites →https://doi.org/10.1145/1008731.1008735openalex-snapshot
Quantum lower bounds for the collision and the element distinctness problems
inferredcites →https://doi.org/10.1145/636865.636867openalex-snapshot
Time-space trade-off lower bounds for randomized computation of decision problems
inferredcites →https://doi.org/10.26421/qic15.7-8-2openalex-snapshot
A note on the quantum collision and set equality problems
inferredcites →https://doi.org/10.4230/lipics.itcs.2024.99openalex-snapshot
Randomized vs. Deterministic Separation in Time-Space Tradeoffs of Multi-Output Functions
inferredcites →https://doi.org/10.5555/2871411.2871413openalex-snapshot
A note on the quantum collision and set equality problems
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-58737-5_1openalex-snapshot
The NISQ Complexity of Collision Finding
inferred← citeshttps://doi.org/10.1007/978-981-95-5113-2_4openalex-snapshot
The Order of Hashing in Fiat-Shamir Schemes
inferred← citeshttps://doi.org/10.1137/1.9781611977073.67openalex-snapshot
Truly Low-Space Element Distinctness and Subset Sum via Pseudorandom Hash Functions
inferred← citeshttps://doi.org/10.1137/24m1638616openalex-snapshot
Quantum Lower Bounds by Sample-to-Query Lifting
inferred← citeshttps://doi.org/10.1145/3618260.3649700openalex-snapshot
Quantum Time-Space Tradeoffs for Matrix Problems
inferred← citeshttps://doi.org/10.1145/3717823.3718266openalex-snapshot
Permutation Superposition Oracles for Quantum Query Lower Bounds
inferred← citeshttps://doi.org/10.1145/3728715openalex-snapshot
Cumulative Memory Lower Bounds for Randomized and Quantum Computation
inferred← citeshttps://doi.org/10.1145/3798129.3800896openalex-snapshot
On the Need for (Quantum) Memory with Short Outputs
inferred← citeshttps://doi.org/10.1186/s42400-026-00568-5openalex-snapshot
On finding quantum multi-collisions in non-uniform random functions
inferred← citeshttps://doi.org/10.22331/q-2023-03-09-944openalex-snapshot
Quantum Multi-Solution Bernoulli Search with Applications to Bitcoin's Post-Quantum Security
inferred← citeshttps://doi.org/10.48550/arxiv.2103.08975openalex-snapshot
Tight Bounds for Inverting Permutations via Compressed Oracle Arguments
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.