2 search results - page 1 / 1 » Lattices that admit logarithmic worst-case to average-case c... |
STOC
2007
ACM
14 years 5 months ago
2007
ACM
We demonstrate an average-case problem that is as hard as finding (n)-approximate shortest vectors in certain n-dimensional lattices in the worst case, where (n) = O( log n). The...
FOCS
2004
IEEE
13 years 9 months ago
2004
IEEE
We show that finding small solutions to random modular linear equations is at least as hard as approximating several lattice problems in the worst case within a factor almost line...