Hardness of proving lattice shortest-vector threshold statements
Statement
Let a lattice be a discrete subgroup of Euclidean space, and let its shortest nonzero integer vector length be the relevant lattice parameter. Lattice shortest-vector hardness conjecture. Proving that a lattice's shortest integer vector exceeds a threshold is hard.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.