Lattice-cryptography is the study and use of lattice problems applied to cryptography.

Lattice cryptography is the use of lattice problems from number theory, applied to the design of cryptographic primitives. Examples of lattice primitives are NTRU, JarJar, New Hope, and New Hope-Simple. Examples of lattice problems used in the design of these primitives are the GapCVP, GapSVP, CVP, and SVP problems. These represent search and decision forms of each problem.