Generating Hard Instances of Lattice Problems Extended abstract

Generating Hard Instances of Lattice Problems Extended abstract

1996 | M. Ajtai
M. Ajtai presents a random class of lattices in \(\mathbf{Z}^n\) such that if there is a probabilistic polynomial time algorithm that finds a short vector in a random lattice with a probability of at least \(\frac{1}{2}\), then there is also a probabilistic polynomial time algorithm that solves three specific lattice problems in every lattice in \(\mathbf{Z}^n\) with a probability exponentially close to one. These problems include finding the length of the shortest nonzero vector, finding the shortest nonzero vector in a lattice where the shortest vector is unique, and finding a basis of the lattice with the smallest possible length. The paper also discusses the implications of these results for one-way functions and subset sum problems. The proof involves constructing a random variable \(\lambda\) and showing that if an algorithm can find a short vector in a lattice defined by \(\lambda\), then it can solve the three lattice problems. The proof relies on various lemmas and theorems related to lattice theory and Diophantine approximation.M. Ajtai presents a random class of lattices in \(\mathbf{Z}^n\) such that if there is a probabilistic polynomial time algorithm that finds a short vector in a random lattice with a probability of at least \(\frac{1}{2}\), then there is also a probabilistic polynomial time algorithm that solves three specific lattice problems in every lattice in \(\mathbf{Z}^n\) with a probability exponentially close to one. These problems include finding the length of the shortest nonzero vector, finding the shortest nonzero vector in a lattice where the shortest vector is unique, and finding a basis of the lattice with the smallest possible length. The paper also discusses the implications of these results for one-way functions and subset sum problems. The proof involves constructing a random variable \(\lambda\) and showing that if an algorithm can find a short vector in a lattice defined by \(\lambda\), then it can solve the three lattice problems. The proof relies on various lemmas and theorems related to lattice theory and Diophantine approximation.
Reach us at info@study.space
Understanding Generating hard instances of lattice problems (extended abstract)