No. | Title | Author | Year |
---|---|---|---|
1 | Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes | Bennett, Huck et al. | 2023 |
2 | Improved Hardness of BDD and SVP Under Gap-(S)ETH | Bennett, Huck et al. | 2022 |
3 | Hardness of Bounded Distance Decoding on Lattices in ?_p Norms | Bennett, Huck et al. | 2020 |
4 | Generating Shorter Bases for Hard Random Lattices | Alwen, Joel et al. | 2009 |
5 | Public-Key Cryptosystems from the Worst-Case Shortest Vector Problem | Peikert, Chris | 2009 |
Current Page : | |
Number of result pages: | 1 |
Number of documents: | 5 |