Search

The security of most lattice-based cryptography schemes are based on two computational hard problems which are the short integer solution (SIS) and learning with errors (LWE) problems. The computational complexity of SIS and LWE problems are related to approximating shortest vector problem and bounded distance decoding (BDD) problem. Approximating BDD is a special case of approximating closest vector problem (CVP). In this paper, we revisit the study for approximating CVP. We give a proof that approximating the CVP over |$\ell _\infty $| -norm (CVP |$_\infty $|⁠) within any constant factor is NP-hard. The result is obtained by the gap-preserving reduction from Min Total Label Cover problem in |$\ell _1$| -norm to to CVP |$_\infty $|⁠. This proof is simpler than known proofs [ 10 ]. [ABSTRACT FROM AUTHOR]

In this paper, we study the approximation complexity of the Minimum Integral Solution Problem with Preprocessing introduced by Alekhnovich et al. (FOCS, pp. 216-225, ). We show that the Minimum Integral Solution Problem with Preprocessing over $$\ell _\infty $$ norm ( $$\hbox {MISPP}_\infty $$ ) is NP-hard to approximate to within a factor of $$(\log n)^{1/2-\epsilon },$$ unless $$\mathbf{NP}\subseteq \mathbf{DTIME}(2^{poly log(n)}).$$ This improves on the best previous result. The best result so far gave $$\sqrt{2}-\epsilon $$ factor hardness for any $$\epsilon >0.$$ [ABSTRACT FROM AUTHOR]

Abstract: The Minimum Integral Solution Problem with preprocessing has been introduced by Alekhnovich, Khot, Kindler, and Vishnoi [M. Alekhnovich, S. Khot, G. Kindler, N. Vishnoi, Hardness of approximating the closest vector problem with preprocessing, in: Proc. 46th IEEE Symposium on FOCS, 2005, pp. 216–225]. They studied the complexity of Minimum Integral Solution Problem with preprocessing over norm . They leave an open problem about the complexity of the Minimum Integral Solution Problem with preprocessing over norm. In this paper, we settle the problem. We show that the Minimum Integral Solution Problem with preprocessing over norm ( ) is NP-hard to approximate to within a factor of for any , unless . [Copyright &y& Elsevier]

Abstract: An equation over a group is an expression of form , where each is either a variable, an inverted variable, or a group constant and denotes the identity element; such an equation is satisfiable if there is a setting of the variables to values in such that the equality is realized (Engebretsen et al. (2002) ). In this paper, we study the problem of simultaneously satisfying a family of equations over an infinite group . Let EQ G [k] denote the problem of determining the maximum number of simultaneously satisfiable equations in which each equation has occurrences of exactly different variables. When is an infinite cyclic group, we show that it is NP-hard to approximate EQ1 G [3] to within , where EQ1 G [3] denotes the special case of EQ G [3] in which a variable may only appear once in each equation; it is NP-hard to approximate EQ1 G [2] to within ; it is NP-hard to approximate the maximum number of simultaneously satisfiable equations of degree at most to within for any ; for any , it is NP-hard to approximate EQ G [k] within any constant factor. These results extend Håstad’s results (Håstad (2001) ) and results of (Engebretsen et al. (2002) ), who established the inapproximability results for equations over finite Abelian groups and any finite groups respectively. [Copyright &y& Elsevier]

Abstract: Let be any fixed real. We show that assuming , it is hard to approximate the Minimum Solutions of Linear Diophantine Equations in norm within any constant factor and it is also hard to approximate the Minimum Solutions of Linear Diophantine Equations in norm within the factor for some constant where is the number of variables in the equations. [Copyright &y& Elsevier]