Euclidean SVP is NP-hard for Cyclic Lattices

2026-09-15

AI Summary

本文证明了在全秩循环整数格上精确的欧几里得SVP问题是NP难的，并将其应用于NTRU形式的格，使用多项式时间图灵归约方法。

Abstract

We prove that exact Euclidean SVP is NP-hard under deterministic polynomial-time many-one reductions for full-rank cyclic integer lattices, equivalently full-rank ideals of $R_N:=\mathbb{Z}[X]/(X^N-1)$ in the coefficient norm. Hardness holds with $N=q-1$ for a varying odd prime $q$. As an application, we prove the same hardness for the algebraic class of NTRU-form lattices $\{(x,z)\in R_N^2:Hx\equiv z\pmod{QR_N}\}$, where $H,Q$ are unrestricted inputs. The decision problems are NP-complete, and the exact search problems are NP-hard under polynomial-time Turing reductions. No hardness claim is made for cryptographic NTRU parameter subclasses or key-generation distributions.

Problem

• Euclidean SVP
• cyclic lattices
• NP-hard
• NTRU-form lattices

Innovation

• Euclidean SVP
• cyclic lattices
• NTRU-form lattices
• NP-hard