Sciweavers

IACR
2011
112views more  IACR 2011»
12 years 4 months ago
Improved Generic Algorithms for Hard Knapsacks
At Eurocrypt 2010, Howgrave-Graham and Joux described an algorithm for solving hard knapsacks of density close to 1 in time ˜O(20.337n ) and memory ˜O(20.256n ), thereby improvin...
Anja Becker, Jean-Sébastien Coron, Antoine ...