Cryptology ePrint Archive: Report 2012/217

Available versions in chronological order

20120422:224703 (posted 22-Apr-2012 22:47:03 UTC): Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems; Itai Dinur and Orr Dunkelman and Nathan Keller and Adi Shamir

[ Cryptology ePrint archive ]