(近似)最短向量问题的困难性:用Reed-Solomon码的简单证明
Hardness of the (Approximate) Shortest Vector Problem: A Simple Proof via Reed-Solomon Codes
摘要:
$\newcommand{\NP}{\mathsf{NP}}\newcommand{\GapSVP}{\textrm{GapSVP}}$我们给出了一个简单的证明,证明了(近似的,决策的)最短向量问题在随机约简下是$\NP$ -困难的。具体来说,我们表明,对于任何$p \geq 1$和任何常数$γ< 2^{1/p}$,$γ$ -近似问题的$\ell_p$规范($γ$ - $\GapSVP_p$)是不是在$\mathsf{RP}$,除非$\NP \subseteq \mathsf{RP}$。我们的证明遵循Ajtai(STOC 1998)开创的方法,并由Micciancio(FOCS 1998和SICOMP 2000)加强,用于使用局部稠密晶格显示$γ$ - $\GapSVP_p$的硬度。我们构造这样的格简单地应用“建设A”的Reed-Solomon码与适当的参数,并证明其局部密度通过一个基本的参数最初使用的背景下,克雷格格。与所有已知的具有$p < \infty$的$\GapSVP_p$的$\NP$硬度结果一样,我们的简化使用随机性。事实上,通过确定性约化来证明$\NP$ -硬度是一个臭名昭著的公开问题。为此,我们还讨论了潜在的方向和相关的挑战去随机化我们的减少。特别是,我们表明,我们的局部密度建设的密切确定性模拟将提高国家的最先进的明确里德-所罗门列表解码下界Guruswami和鲁德拉(STOC 2005年和IEEE的trans. inf. Theory 2006)。作为一个相关的贡献的独立利益,我们也给出了一个多项式时间算法解码$n$维“建设一个里德-所罗门格”(与不同的参数比我们的硬度证明中使用的)的距离内的$O(\sqrt{\log n})$因素的闵可夫斯基的界限。由于Mook和Peikert(IEEE Trans. Inf. Theory 2022)的工作,这与Minkowski边界附近的解码的最佳已知距离渐近匹配,我们以更简单的构造和分析为基础。
英文摘要:
$\newcommand{\NP}{\mathsf{NP}}\newcommand{\GapSVP}{\textrm{GapSVP}}$We give a simple proof that the (approximate, decisional) Shortest Vector Problem is $\NP$-hard under a randomized reduction. Specifically, we show that for any $p \geq 1$ and any constant $γ< 2^{1/p}$, the $γ$-approximate problem in the $\ell_p$ norm ($γ$-$\GapSVP_p$) is not in $\mathsf{RP}$ unless $\NP \subseteq \mathsf{RP}$. Our proof follows an approach pioneered by Ajtai (STOC 1998), and strengthened by Micciancio (FOCS 1998 and SICOMP 2000), for showing hardness of $γ$-$\GapSVP_p$ using locally dense lattices. We construct such lattices simply by applying "Construction A" to Reed-Solomon codes with suitable parameters, and prove their local density via an elementary argument originally used in the context of Craig lattices. As in all known $\NP$-hardness results for $\GapSVP_p$ with $p < \infty$, our reduction uses randomness. Indeed, it is a notorious open problem to prove $\NP$-hardness via a deterministic reduction. To this end, we additionally discuss potential directions and associated challenges for derandomizing our reduction. In particular, we show that a close deterministic analogue of our local density construction would improve on the state-of-the-art explicit Reed-Solomon list-decoding lower bounds of Guruswami and Rudra (STOC 2005 and IEEE Trans. Inf. Theory 2006). As a related contribution of independent interest, we also give a polynomial-time algorithm for decoding $n$-dimensional "Construction A Reed-Solomon lattices" (with different parameters than those used in our hardness proof) to a distance within an $O(\sqrt{\log n})$ factor of Minkowski's bound. This asymptotically matches the best known distance for decoding near Minkowski's bound, due to Mook and Peikert (IEEE Trans. Inf. Theory 2022), whose work we build on with a somewhat simpler construction and analysis.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。