Articles under category:
Lattice
Lattice
Vol 14, Article 13 (pp 1-17)
On the Hardness of Learning With Errors with Binary Secrets by Daniele Micciancio |
Vol 8, Article 23 (pp 513-531)
Tensor-based Hardness of the Shortest Vector Problem to within Almost Polynomial Factors by Ishay Haviv and Oded Regev |
Vol 8, Article 22 (pp 487-512)
Inapproximability of the Shortest Vector Problem: Toward a Deterministic Reduction by Daniele Micciancio |