Low-gate quantum golden collision finding
From MaRDI portal
Publication:832353
DOI10.1007/978-3-030-81652-0_13zbMath1487.81067OpenAlexW3111500848MaRDI QIDQ832353
Samuel Jaques, André Schrottenloher
Publication date: 25 March 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-81652-0_13
Cryptography (94A60) Random walks, random surfaces, lattice animals, etc. in equilibrium statistical mechanics (82B41) Collisions in celestial mechanics, regularization (70F16) Quantum coding (general) (81P70) Quantum cryptography (quantum-theoretic aspects) (81P94) Computer security (68M25)
Related Items (5)
A new adaptive attack on SIDH ⋮ On the Security of OSIDH ⋮ Finding many collisions via reusable quantum walks. Application to lattice sieving ⋮ Breaking the Quadratic Barrier: Quantum Cryptanalysis of Milenage, Telecommunications’ Cryptographic Backbone ⋮ Quantum attacks on hash constructions with low quantum random access memory
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On the concrete hardness of learning with errors
- Lower bounds for sorting on mesh-connected architectures
- Parallel collision search with cryptanalytic applications
- Estimating the cost of generic quantum pre-image attacks on SHA-2 and SHA-3
- An efficient quantum collision search algorithm and implications on symmetric cryptography
- On the cost of computing isogenies between supersingular elliptic curves
- Low-communication parallel quantum multi-target preimage search
- A framework for reducing the overhead of the quantum oracle for use with Grover's algorithm with applications to cryptanalysis of SIKE
- Improved classical cryptanalysis of SIKE in practice
- Implementing Grover oracles for quantum key search on AES and LowMC
- Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms
- Quantum cryptanalysis in the RAM model: claw-finding attacks on SIKE
- Applying Grover’s Algorithm to AES: Quantum Resource Estimates
- Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- Search via Quantum Walk
- A Note on Bennett’s Time-Space Tradeoff for Reversible Computation
- Quantum lower bounds for the collision and the element distinctness problems
- An Improved Claw Finding Algorithm Using Quantum Walk
- Time/Space Trade-Offs for Reversible Computation
- On the robustness of bucket brigade quantum RAM
- Quantum Algorithms for Element Distinctness
- Efficient distributed quantum computing
- Quantum Walk Algorithm for Element Distinctness
- On the height of trees
- Quantum cryptanalysis of hash and claw-free functions
This page was built for publication: Low-gate quantum golden collision finding
