4 papers
SVP Is NP-Hard for Some Rank-2 Cyclotomic Modules
Jiaqi Liu, Yansong Feng, Yanbin Pan
Let range over primes congruent to modulo . Let be a primitive th root of unity, and put , with ring of integers $\mathcal{O}_K=\mathbb{Z}[ζ_…
Exact CVP Is NP-Complete for Principal Cyclotomic Ideals
Jiaqi Liu, Yansong Feng, Yanbin Pan
We prove that exact Euclidean decision-CVP is -complete on coefficient lattices of nonzero principal ideals in the power-of-two cyclotomic rings $R_d=\mathbb{Z}[y]/(y^…
Subset Balancing and Generalized Subset Sum via Lattices
Yiming Gao, Yansong Feng, Honggang Hu +1
We study the Subset Balancing problem: given and a coefficient set , find a nonzero vector such that . The st…
On Factoring and Power Divisor Problems via Rank-3 Lattices and the Second Vector
Yiming Gao, Yansong Feng, Honggang Hu +1
We propose a deterministic algorithm based on Coppersmith's method that employs a rank-3 lattice to address factoring-related problems. An interesting aspect of our approach is tha…