25 search results - page 1 / 5 » On the Limits of Nonapproximability of Lattice Problems |
JCSS
2000
13 years 5 months ago
2000
STOC
1999
ACM
13 years 9 months ago
1999
ACM
Motivated by Ajtai’s worst-case to average-case reduction for lattice problems, we study the complexity of computing short linearly independent vectors (short basis) in a lattic...
ASIACRYPT
2011
Springer
12 years 5 months ago
2011
Springer
A cryptographic assumption is the (unproven) mathematical statement that a certain computational problem (e.g. factoring integers) is computationally hard. The leakage-resilience l...
CC
2008
Springer
13 years 5 months ago
2008
Springer
CORR
2010
Springer
13 years 2 months ago
2010
Springer
To find the best lattice model representation of a given full atom protein structure is a hard computational problem. Several greedy methods have been suggested where results are ...