341 search results - page 22 / 69 » Quantum Computation and Lattice Problems |
104
click to vote
FOCS
2004
IEEE
15 years 3 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 ...
89
Voted
STOC
2007
ACM
16 years 15 hour 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...
ECCV
2006
Springer
16 years 1 months ago
2006
Springer
Abstract. Understanding texture regularity in real images is a challenging computer vision task. We propose a higher-order feature matching algorithm to discover the lattices of ne...
115
click to vote
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We give an algorithm for solving the exact Shortest Vector Problem in n-dimensional lattices, in any norm, in deterministic 2O(n) time (and space), given poly(n)-sized advice that...
183
click to vote
CRYPTO
1997
Springer
15 years 3 months ago
1997
Springer
We present a new proposal for a trapdoor one-way function, from which we derive public-key encryption and digital signatures. The security of the new construction is based on the ...