搜索结果: 1-3 共查到“密码学 Unique Shortest Vector Problem”相关记录3条 . 查询时间(0.046 秒)
Improved Reduction from the Bounded Distance Decoding Problem to the Unique Shortest Vector Problem in Lattices
Lattices Bounded Distance Decoding Problem Unique Shortest Vector Problem
2016/12/12
We present a probabilistic polynomial-time reduction from the lattice Bounded Distance Decoding (BDD) problem with parameter 1/(2√⋅γ2⋅γ) to the unique Shortest Vector Problem (uSVP) with p...
The nc-Unique Shortest Vector Problem is Hard
nc-Unique Shortest Vector Problem GapSVP uSVP
2009/6/10
The unique Shortest Vector Problem (uSVP) gained prominence because it was the problem
upon which the first provably-secure lattice-based cryptosystems were built. But it was an open problem as to wh...
Unique Shortest Vector Problem for max norm is NP-hard
unique closest vector problem unique subspace avoiding problem Lattice
2009/6/8
The unique Shortest vector problem (uSVP) in lattice theory plays a crucial role in many
public-key cryptosystems. The security of those cryptosystems bases on the hardness of uSVP. However,
so far ...