612 search results - page 3 / 123 » Hardness assumptions in the foundations of theoretical compu... |
STACS
2009
Springer
14 years 2 months ago
2009
Springer
We revisit the problem of generating a “hard” random lattice together with a basis of relatively short vectors. This problem has gained in importance lately due to new cryptogr...
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
FOCS
2000
IEEE
14 years 2 days ago
2000
IEEE
FOCS
2005
IEEE
14 years 1 months ago
2005
IEEE
d Abstract] Mikhail Alekhnovich ∗ Subhash A. Khot † Guy Kindler ‡ Nisheeth K. Vishnoi § We show that, unless NP⊆DTIME(2poly log(n) ), the closest vector problem with pre-...