Lattice Problem
In computer science, lattice problems are a class of optimization problems on lattices. The conjectured intractability of such problems is central to construction of secure lattice-based cryptosystems. For applications in such cryptosystems, lattices over vector spaces (often ) or free modules (often ) are generally considered.
For all the problems below, assume that we are given (in addition to other more specific inputs) a basis for the vector space V and a norm N. The norms usually considered are L2. However, other norms (such as Lp) are also considered and show up in a variety of results. Let denote the length of the shortest non-zero vector in the lattice L: 
.
Read more about Lattice Problem: Shortest Vector Problem (SVP), GapSVP, Closest Vector Problem (CVP), GapCVP, Shortest Independent Vector Problem (SIVP), Bounded Distance Decoding, Covering Radius Problem, Shortest Basis Problem, Use in Cryptography, See Also
Famous quotes containing the word problem:
“The thinking person has the strange characteristic to like to create a fantasy in the place of the unsolved problem, a fantasy that stays with the person even when the problem has been solved and truth made its appearance.”
—Johann Wolfgang Von Goethe (1749–1832)