Shortest Vector Problem (SVP)
QuantumShortest Vector Problem (SVP): The task of finding the shortest non-zero vector in a lattice, a problem thought to resist quantum attack and underlying lattice cryptography.
Shortest Vector Problem (SVP): The task of finding the shortest non-zero vector in a lattice, a problem thought to resist quantum attack and underlying lattice cryptography.