Abstract
This paper introduces a subset-sum algorithm with heuristic asymptotic cost exponent below 0.25. The new algorithm combines the 2010 Howgrave-Graham--Joux subset-sum algorithm with a new streamlined data structure for quantum walks on Johnson graphs.
| Original language | English |
|---|---|
| Publisher | International Association for Cryptologic Research |
| Number of pages | 18 |
| Publication status | Published - 2013 |
Publication series
| Name | Cryptology ePrint Archive |
|---|---|
| Volume | 2013/199 |
Fingerprint
Dive into the research topics of 'Quantum algorithms for the subset-sum problem'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver