Cryptology ePrint Archive: Report 2008/366

Available versions in chronological order

20080827:152309 (posted 27-Aug-2008 15:23:09 UTC): Unique Shortest Vector Problem for max norm is NP-hard; Than Quang Khoat and Nguyen Hong Tan
20080928:082710 (posted 28-Sep-2008 08:27:10 UTC): Unique Shortest Vector Problem for max norm is NP-hard; Than Quang Khoat and Nguyen Hong Tan

[ Cryptology ePrint archive ]