.png){kind=icon}
返回
An Efficient Algorithm for the Shortest Vector Problem
.png){kind=icon}
OA
AI
DOI：10.1109/ACCESS.2018.2876401.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Lattice is widely used in cryptography since it has potential for defending quantum attacks. One of the significant problems in such cryptography is the shortest vector problem (SVP). This problem is to find the non-zero shortest vector in lattice. The SVP is an NP-hard problem under randomized reductions proven by Ajtai, and many cryptosystems are secure under the assumption that SVP is hard, such as NTRU. On the other hand, some primitives of lattice-based cryptography require relatively short vectors. In this paper, we propose a new SVP algorithm that can be performed in time complexity O(n(3)). We also prove that the Hermite factor of the proposed algorithm is polynomial-bounded.
Keyword:
Shortest vector problem
algorithm analysis
optimization theory
lattice
lattice-based cryptography
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.6
论文数:
9.8W
被引数:
29.4W
机构
引用论文
Effect Study of Aperture Distribution on the Capillary Pressure-Saturation Relation for the Single Fracture.png)
GeofluidsOAAI
GeofluidsIF0
OAAI分享收藏
查看更多内容