Approximate Algorithms on Lattices with Small Determinant ( Extended Abstract )

@inproceedings{Cheon2016ApproximateAO,
  title={Approximate Algorithms on Lattices with Small Determinant ( Extended Abstract )},
  author={Jung Hee Cheon and Changmin Lee},
  year={2016}
}
In this paper, we propose approximate lattice algorithms for solving the shortest vector problem (SVP) and the closest vector problem (CVP) on an n-dimensional Euclidean integral lattice L. Our algorithms run in polynomial time of the dimension and determinant of lattices and improve on the LLL algorithm when the determinant of a lattice is less than 2 2/4. More precisely, our approximate SVP algorithm gives a lattice vector of size ≤ 2 √ log detL and our approximate CVP algorithm gives a… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 27 references

Similar Papers

Loading similar papers…