Cryptology ePrint Archive: Report 2015/639
Available versions in chronological order
20150630:191311 (posted 30-Jun-2015 19:13:11 UTC)
Polynomial time reduction from approximate shortest vector problem to principle ideal probelm for lattices in cyclotomic rings
Hao Chen
20150701:064537 (posted 01-Jul-2015 06:45:37 UTC)
Polynomial time reduction from approximate shortest vector problem to the principle ideal porblem for lattices in cyclotomic rings
Hao Chen
[
Cryptology ePrint archive
]