29 search results - page 4 / 6 » A Lattice Problem in Quantum NP |
FOCS
1998
IEEE
13 years 10 months ago
1998
IEEE
We show that approximating the shortest vector problem (in any p norm) to within any constant factor less than p 2 is hard for NP under reverse unfaithful random reductions with i...
STOC
2003
ACM
14 years 6 months ago
2003
ACM
The design of new quantum algorithms has proven to be an extremely difficult task. This paper considers a different approach to the problem, by studying the problem of 'quant...
ASIACRYPT
2010
Springer
13 years 4 months ago
2010
Springer
Blind signatures (BS), introduced by Chaum, have become a cornerstone in privacy-oriented cryptography. Using hard lattice problems, such as the shortest vector problem, as the bas...
JSCIC
2008
13 years 5 months ago
2008
Abstract An epitaxial thin film consists of layers of atoms whose lattice properties are determined by those of the underlying substrate. This paper reviews mathematical modeling, ...
STOC
1999
ACM
13 years 10 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...