Cryptology ePrint Archive: Report 2008/504

Available versions in chronological order

20081202:020649 (posted 02-Dec-2008 02:06:49 UTC): The $n^c$-Unique Shortest Vector Problem is Hard; Vadim Lyubashevsky

[ Cryptology ePrint archive ]