Cryptology ePrint Archive: Report 2011/521

Available versions in chronological order

20110925:161232 (posted 25-Sep-2011 16:12:32 UTC): Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions; Daniele Micciancio and Petros Mol; Publication Info: A preliminary version of this work appears in the Proceedings of CRYPTO 2011. This is the full version of the paper.
20110926:223605 (posted 26-Sep-2011 22:36:05 UTC): Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions; Daniele Micciancio and Petros Mol; Publication Info: A preliminary version of this work appears in the Proceedings of CRYPTO 2011. This is the full version of the paper.
20110926:223705 (posted 26-Sep-2011 22:37:05 UTC): Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions; Daniele Micciancio and Petros Mol; Publication Info: A preliminary version of this work appears in the Proceedings of CRYPTO 2011. This is the full version of the paper.