Questions tagged [svp]

Suppose $O(n^a)$-approximate SVP ($\infty$ norm) can be solved in $\mathsf{PTIME}$ (say quadratic or cubic time) for say an $a\in[1,1.5]$, is there any consequence to post quantum cryptography? Such as is there any effect on LWE, SIS, etc. based…

As we know, finding the shortest vector in a lattice is a hard problem. We also know that there is a polynomial-time algorithm for finding SVP, which, of course, not have optimal performance in large dimensions. However, from a cryptographic…

We know (search) approximate Shortest Vector Problem ($\mathsf{SVP}_{\gamma}$): Given an arbitrary basis $\mathbf{B}$ of some lattice $\mathcal{L}=\mathcal{L}(\mathbf{B})$, find a shortest non-zero lattice vector, i.e., a $\mathbf{v}\in\mathcal{L}$…