Improved Generic Algorithms for Hard Knapsacks

  • Anja Becker
  • Jean-Sébastien Coron
  • Antoine Joux
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6632)

Abstract

At Eurocrypt 2010, Howgrave-Graham and Joux described an algorithm for solving hard knapsacks of density close to 1 in time \({\mathcal{\tilde O}}(2^{0.337n})\) and memory \({\mathcal{\tilde O}}(2^{0.256n})\), 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 \({\mathcal{\tilde O}}(2^{0.291n})\). 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 \({\mathcal{\tilde O}}(2^{0.72n})\); we also show a time-memory tradeoff.

Copyright information

© International Association for Cryptologic Research 2011

Authors and Affiliations

  • Anja Becker
    • 1
  • Jean-Sébastien Coron
    • 3
  • Antoine Joux
    • 1
    • 2
  1. 1.University of VersaillesSaint-Quentin-en-YvelinesFrance
  2. 2.DGAUSA
  3. 3.University of LuxembourgLuxembourg

Personalised recommendations