35 search results - page 2 / 7 » On polynomial approximation to the shortest lattice vector l... |
FOCS
2004
IEEE
13 years 9 months ago
2004
IEEE
Let p > 1 be any fixed real. We show that assuming NP RP, there is no polynomial time algorithm that approximates the Shortest Vector Problem (SVP) in p norm within a constant ...
TOC
2008
13 years 5 months ago
2008
Abstract: Schnorr's algorithm for finding an approximation for the shortest nonzero vector in an n-dimensional lattice depends on a parameter k. He proved that for a fixed k ...
CRYPTO
2009
Springer
14 years 10 days ago
2009
Springer
We prove the equivalence, up to a small polynomial approximation factor n/ log n, of the lattice problems uSVP (unique Shortest Vector Problem), BDD (Bounded Distance Decoding) and...
STOC
2003
ACM
14 years 6 months ago
2003
ACM
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...