搜索结果: 1-1 共查到“密码学 Bounded Distance Decoding Problem”相关记录1条 . 查询时间(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...