# Tag Info

I am unaware of cryptography that is hard solely assuming that $P\neq NP$, so I believe you are misunderstanding something. I know the story best when it comes to lattices, so I'll discuss why lattices are solely "adjacent" to an $NP$-hard problem. The story is rather simple, but also technical. Let $\mathsf{LWE}[n, \sigma, q]$ be the average-case ...