612 search results - page 3 / 123 » Hardness assumptions in the foundations of theoretical compu... |
154
click to vote
STACS
2009
Springer
16 years 25 days 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...
149
click to vote
FOCS
2005
IEEE
15 years 11 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-...