Quantum algorithms for the subset-sum problem

D.J. Bernstein, S. Jeffery, T. Lange, A. Meurer

Research output: Book/ReportReportAcademic

33 Citations (Scopus)
1 Downloads (Pure)


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 languageEnglish
Number of pages18
Publication statusPublished - 2013

Publication series

NameCryptology ePrint Archive


Dive into the research topics of 'Quantum algorithms for the subset-sum problem'. Together they form a unique fingerprint.

Cite this