EUVIMEDEUVIMED entdecken
Crossref

The Complexity of the Shortest Vector Problem

Huck Bennett

ACM SIGACT News · 28.02.2023 · 54 (1) · 37-61

DOI: 10.1145/3586165.3586172 ↗

Kurz gefasst

Fachartikel in der Zeitschrift ACM SIGACT News, 2023-03. Verfasst von Huck Bennett. Die Arbeit wurde bisher 10-mal zitiert (Crossref) und nennt 93 Literaturangaben.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

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).

Zitieren

APA

Bennett, H. (2023). The Complexity of the Shortest Vector Problem. ACM SIGACT News, 54(1), 37-61. https://doi.org/10.1145/3586165.3586172

Vancouver

Bennett H. The Complexity of the Shortest Vector Problem. ACM SIGACT News. 2023;54(1):37-61. doi:10.1145/3586165.3586172

BibTeX
@article{Bennett2023,
  author = {Bennett, Huck},
  title = {The Complexity of the Shortest Vector Problem},
  journal = {ACM SIGACT News},
  year = {2023},
  volume = {54},
  number = {1},
  pages = {37--61},
  doi = {10.1145/3586165.3586172}
}
Kostenlos starten →