4 problems

Let $\mathrm{SVP}$ denote the Shortest Vector Problem on lattices, and let a polynomial-factor approximation mean an approximation within a factor bounded by a polynomial in the la…

Let $\mathbb{E}_{p^2}$ be an entropoid, with $p=2q+1$ a safe prime having $\lambda$ bits, and let $g$ generate $\mathbb{E}^*_{(p-1)^2}$. Let $\mathcal{A}$ be an algorithm for CDERP…

3-XOR distinguishing hardness conjecture. There is some constant $\eta<1/4$ such that no algorithm that succeeds for the 3-XOR distinguishing problem with $m=o(d^{3/2})$ runs in po…

Let $G$ be a $3$-colorable graph on $n$ nodes. Hardness of approximate $3$-coloring. For some fixed $\gamma > 0$, there is no polynomial time algorithm that, given $G$, returns a v…