Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Lattice problem

Known as: CVP, Lattice problems, Gapsvp 
In computer science, lattice problems are a class of optimization problems on lattices. The conjectured intractability of such problems is central to… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2013
Highly Cited
2013
The “learning with errors” (LWE) problem is to distinguish random linear equations, which have been perturbed by a small amount… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
Our main result is a reduction from worst-case lattice problems such as GapSVP and SIVP to a certain learning problem. This… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2008
Highly Cited
2008
We show how to construct a variety of "trapdoor" cryptographic tools assuming the worst-case hardness of standard lattice… Expand
Is this relevant?
Highly Cited
2005
Highly Cited
2005
Our main result is a reduction from worst-case lattice problems such as SVP and SIVP to a certain learning problem. This learning… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2002
Highly Cited
2002
Aromatic alkenyl compounds, for example, eugenol and safrole, are isomerized, for example to isoeugenol and isosafrole, by… Expand
Is this relevant?
Highly Cited
2001
Highly Cited
2001
We present a randomized 2^{<italic>O(n)</italic>} time algorithm to compute a shortest non-zero vector in an <italic>n</italic… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
We give a random class of lattices in Zn whose elements can be generated together with a short vector in them so that, if there… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
  • Miklós Ajtai
  • Electronic Colloquium on Computational Complexity
  • 1996
  • Corpus ID: 1480070
We give a random class of lattices in Z n so that, if there is a probabilistic polynomial time algorithm which nds a short vector… Expand
Is this relevant?
Highly Cited
1996
Highly Cited
1996
In 1995, Ajtai described a construction of one-way functions whose security is equivalent to the difficulty of some well known… Expand
  • figure 1
  • figure 2
Is this relevant?
Highly Cited
1983
Highly Cited
1983
The integer programming problem is: Given m×n and m×l matrices A and b respectively of integers, find whether, there exists an… Expand
Is this relevant?