The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound

DOI10.1007/978-3-030-44223-1_24OpenAlexW3015421133MaRDI QIDQ5041235

Alexander Helm, Alexander May

Publication date: 13 October 2022

Published in: Post-Quantum Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-030-44223-1_24

zbMATH Keywords

quantum algorithmssubset sumamplitude amplificationrepresentation techniquecollision finding

Mathematics Subject Classification ID

Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12) Quantum cryptography (quantum-theoretic aspects) (81P94)

Related Items (1)

Improved classical and quantum algorithms for subset-sum

Cites Work

• An efficient quantum collision search algorithm and implications on symmetric cryptography
• Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
• Improved Generic Algorithms for Hard Knapsacks
• New Generic Algorithms for Hard Knapsacks
• A $T = O(2^{n/2} )$, $S = O(2^{n/4} )$ Algorithm for Certain NP-Complete Problems
• Quantum Algorithms for the Subset-Sum Problem
• Quantum cryptanalysis of hash and claw-free functions
• On lattices, learning with errors, random linear codes, and cryptography
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Power of Few Qubits and Collisions – Subset Sum Below Grover’s Bound