Lattice problems

Lattice problems

In the following computational problems on lattices are described. These problems are essential for lattice based cryptosystems.

The Shortest Vector Problem (SVP)

In SVP, a basis B of a lattice L is given and one must find the shortest non-zero vector in lattice L. In a approximation version, one must find a a non-zero lattice vector of length at most gamma len(shortest vector).

The Closest Vector Problem (CVP)

In CVP, a basis B of a lattice L and a vector v not necessarily in the lattice. One must find the lattice vector in L closest to v. In the gamma-approximation version one must find a lattice vector at distane at most gamma dist(v, L).

hortest Independent Vector Problem (SIVP)

Given a lattice L with dimension n, find n linear independent vectors v_1, v_2, ..., v_n of length max ||v_i|| ≤ gamma lambda_n(L)

Bibliography

* Daniele Micciancio: The Shortest Vector Problem is {NP}-hard to approximate to within some constant. SIAM Journal on Computing. 2001,


The_SVP_by_exampleImage:Cvp3.png‎|The_CVP_by_example


Wikimedia Foundation. 2010.

Игры ⚽ Поможем сделать НИР

Look at other dictionaries:

  • 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,… …   Wikipedia

  • Lattice (group) — A lattice in the Euclidean plane. In mathematics, especially in geometry and group theory, a lattice in Rn is a discrete subgroup of Rn which spans the real vector space Rn. Every lattice in Rn …   Wikipedia

  • Lattice based cryptography — is the generic term for asymmetric cryptographic primitives based on lattice. HistoryLattice have first been discovered by mathematicans Lagrange and Gauss. Lattice have been used laterly in computer algorithms and in cryptanalysis. In 1996 Atjai …   Wikipedia

  • Lattice gas automaton — Lattice gas automata (LGA) or lattice gas cellular automata (LGCA) methods are a series of cellular automata methods used to simulate fluid flows. It was the precursor to the lattice Boltzmann methods. From the LGCA, it is possible to derive the… …   Wikipedia

  • Lattice gauge theory — In physics, lattice gauge theory is the study of gauge theories on a spacetime that has been discretized onto a lattice. Although most lattice gauge theories are not exactly solvable, they are of tremendous appeal because they can be studied by… …   Wikipedia

  • Lattice reduction — In mathematics, the goal of lattice basis reduction is given an integer lattice basis as input, to find a basis with short, nearly orthogonal vectors. This is realized using different algorithms, whose running time is usually at least exponential …   Wikipedia

  • Congruence lattice problem — In mathematics, the congruence lattice problem asks whether every algebraic distributive lattice is isomorphic to the congruence lattice of some other lattice. The problem was posed by Robert P. Dilworth, and for many years it was one of the most …   Wikipedia

  • Lenstra–Lenstra–Lovász lattice basis reduction algorithm — The Lenstra–Lenstra–Lovász lattice basis reduction (LLL) is a polynomial time lattice reduction algorithm invented by Arjen Lenstra, Hendrik Lenstra and László Lovász. Given as input d lattice basis vectors with n dimensional integer coordinates… …   Wikipedia

  • Post's lattice — In logic and universal algebra, Post s lattice denotes the lattice of all clones on a two element set {0, 1}, ordered by inclusion. It is named for Emil Post, who published a complete description of the lattice in 1941 [E. L. Post, The two valued …   Wikipedia

  • Particle in a one-dimensional lattice — In quantum mechanics, the particle in a one dimensional lattice is a problem that occurs in the model of a periodic crystal lattice. The potential is caused by ions in the periodic structure of the crystal creating an electromagnetic field so… …   Wikipedia

Share the article and excerpts

Direct link
Do a right-click on the link above
and select “Copy Link”