Welcome to the resource topic for 2013/199
Title:
Quantum algorithms for the subset-sum problem
Authors: Daniel J. Bernstein, Stacey Jeffery, Tanja Lange, Alexander Meurer
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.
ePrint: https://eprint.iacr.org/2013/199
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .