Lattice problem

Known as: Lattice problems, Gapsvp, Shortest vector problem 
In computer science, lattice problems are a class of optimization problems on lattices. The conjectured intractability of such problems is central to… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1973-2017
0204019732017

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2010
Highly Cited
2010
The “learning with errors” (LWE) problem is to distinguish random linear equations, which have been perturbed by a… (More)
Is this relevant?
Highly Cited
2007
Highly Cited
2007
We show how to construct a variety of "trapdoor" cryptographic tools assuming the worst-case hardness of standard lattice… (More)
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2004
Highly Cited
2004
We show that the problems of approximating the shortest and closest vector in a lattice to within a factor of √ n lie in NP… (More)
  • figure 1
Is this relevant?
Highly Cited
2002
Highly Cited
2002
We present the first explicit connection between quantum computation and lattice problems. Namely, our main result is a solution… (More)
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… (More)
Is this relevant?
Highly Cited
1997
Highly Cited
1997
We show simple constant-round interactive proof systems for problems capturing the approximability, to within a factor of n, of… (More)
Is this relevant?
Highly Cited
1996
Highly Cited
1996
  • Miklós Ajtai
  • Electronic Colloquium on Computational Complexity
  • 1996
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… (More)
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… (More)
  • figure 1
  • figure 2
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… (More)
Is this relevant?