Improved (Provable) Algorithms for the Shortest Vector Problem via Bounded Distance Decoding.
STACS
Saved in:
Main Authors: | Aggarwal, Divesh, Kumar, Rajendra, Chen, Yanlin, Shen, Yixin |
---|---|
Other Authors: | DEPARTMENT OF COMPUTER SCIENCE |
Format: | Conference or Workshop Item |
Published: |
2021
|
Online Access: | https://scholarbank.nus.edu.sg/handle/10635/186947 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | National University of Singapore |
Similar Items
-
On the bounded distance decoding problem for lattices constructed and their cryptographic applications
by: Li, Zhe, et al.
Published: (2020) -
QUANTUM ALGORITHMS FOR PROVABLE MACHINE LEARNING
by: YANG SIYI
Published: (2021) -
Shortest path and distance queries on road networks : an experimental evaluation
by: Wu, Lingkun, et al.
Published: (2013) -
Provable Security
Published: (2017) -
Towards a better solution to the shortest common supersequence problem: The deposition and reduction algorithm
by: Ning, K., et al.
Published: (2013)