Skip to Main content Skip to Navigation
Conference papers

Improved Generic Algorithms for Hard Knapsacks

Abstract : At Eurocrypt 2010, Howgrave-Graham and Joux described an algorithm for solving hard knapsacks of density close to 1 in time (20337n) and memory (20256n), thereby improving a 30-year old algorithm by Shamir and Schroeppel. In this paper we extend the Howgrave-Graham-Joux technique to get an algorithm with running time down to (20291n). An implementation shows the practicability of the technique. Another challenge is to reduce the memory requirement. We describe a constant memory algorithm based on cycle finding with running time (2072n); we also show a time-memory tradeoff.
Document type :
Conference papers
Complete list of metadata
Contributor : Isabelle Moudenner Cohen Connect in order to contact the contributor
Submitted on : Monday, January 30, 2012 - 1:11:11 PM
Last modification on : Wednesday, October 20, 2021 - 12:24:14 AM

Links full text




Anja Becker, Jean-Sébastien Coron, Antoine Joux. Improved Generic Algorithms for Hard Knapsacks. Eurocrypt 2011, May 2011, Tallinn, Estonia. pp.364-385, ⟨10.1007/978-3-642-20465-4_21⟩. ⟨hal-00664332⟩



Record views