Improved quantum algorithms for the k-XOR problem
From MaRDI portal
Publication:6618596
DOI10.1007/978-3-030-99277-4_15MaRDI QIDQ6618596FDOQ6618596
Authors: André Schrottenloher 
Publication date: 14 October 2024
Cites Work
- Search via Quantum Walk
- Title not available (Why is that?)
- Quantum Walk Algorithm for Element Distinctness
- Title not available (Why is that?)
- Improved Generic Algorithms for Hard Knapsacks
- A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
- Title not available (Why is that?)
- The Knapsack Hash Function proposed at Crypto’89 can be broken
- The extended \(k\)-tree algorithm
- Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
- Adversary lower bound for the k-sum problem
- Another Subexponential-time Quantum Algorithm for the Dihedral Hidden Subgroup Problem
- New generic algorithms for hard knapsacks
- An efficient quantum collision search algorithm and implications on symmetric cryptography
- Optimal merging in quantum \(k\)-xor and \(k\)-sum algorithms
- Quantum Algorithms for Element Distinctness
- Quantum Algorithms for the Subset-Sum Problem
- Quantum algorithms for the \(k\)-XOR problem
- Quantum algorithms for the approximate \(k\)-list problem and their application to lattice sieving
- Refinements of the k-tree Algorithm for the Generalized Birthday Problem
- Quantum information set decoding algorithms
- Improved combinatorial algorithms for the inhomogeneous short integer solution problem
- An algorithmic framework for the generalized birthday problem
- How to record quantum queries, and applications to quantum indifferentiability
- Improved classical and quantum algorithms for subset-sum
This page was built for publication: Improved quantum algorithms for the k-XOR problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6618596)
