The Complexity of the Shortest Vector Problem-Reference-Cited by-同舟云学术

The Complexity of the Shortest Vector Problem

Published:2023-02-28 Issue:1 Volume:54 Page:37-61
ISSN:0163-5700
Container-title:ACM SIGACT News
language:en
Short-container-title:SIGACT News

Author:

Bennett Huck¹

Affiliation:

1. Oregon State University, OR, USA

Abstract

Computational problems on point lattices play a central role in many areas of computer science including integer programming, coding theory, cryptanalysis, and especially the design of secure cryptosystems. In this survey, we present known results and open questions related to the complexity of the most important of these problems, the Shortest Vector Problem (SVP).

Publisher

Association for Computing Machinery (ACM)

Subject

General Materials Science

Link

https://dl.acm.org/doi/pdf/10.1145/3586165.3586172

Reference93 articles.

1. [ABB+22] D. Aggarwal , H. Bennett , Z. Brakerski , A. Golovnev , R. Kumar , Z. Li , S. Peters , N. Stephens- Davidowitz , and V. Vaikuntanathan . Lattice problems beyond polynomial time , 2022 . Preprint . 4, 13, 14, 18 [ABB+22] D. Aggarwal, H. Bennett, Z. Brakerski, A. Golovnev, R. Kumar, Z. Li, S. Peters, N. Stephens- Davidowitz, and V. Vaikuntanathan. Lattice problems beyond polynomial time, 2022. Preprint. 4, 13, 14, 18

2. [ABD+17] R. Avanzi , J. Bos , L. Ducas , E. Kiltz , T. Lepoint , V. Lyubashevsky , J. M. Schanck , P. Schwabe , G. Seiler , and D. Stehl´e . Cryptographic suite for algebraic lattices (CRYSTALS). https: //pq-crystals.org/ , 2017 . 1, 16 [ABD+17] R. Avanzi, J. Bos, L. Ducas, E. Kiltz, T. Lepoint, V. Lyubashevsky, J. M. Schanck, P. Schwabe, G. Seiler, and D. Stehl´e. Cryptographic suite for algebraic lattices (CRYSTALS). https: //pq-crystals.org/, 2017. 1, 16

3. Fine-grained hardness of CVP(P)-everything that we can prove (and nothing else);Aggarwal D.;SODA.,2021

4. The Hardness of Approximate Optima in Lattices, Codes, and Systems of Linear Equations

5. [ACD+18] M. R. Albrecht , B. R. Curtis , A. Deo , A. Davidson , R. Player , E. W. Postlethwaite , F. Virdia , and T. Wunderer . Estimate all the {LWE , NTRU} schemes! In SCN. 2018 . 5 [ACD+18] M. R. Albrecht, B. R. Curtis, A. Deo, A. Davidson, R. Player, E. W. Postlethwaite, F. Virdia, and T. Wunderer. Estimate all the {LWE, NTRU} schemes! In SCN. 2018. 5

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Lattice Problems beyond Polynomial Time;Proceedings of the 55th Annual ACM Symposium on Theory of Computing;2023-06-02

2. Fine-Grained Hardness of Unique Shortest Vector Problem;2023