341 search results - page 1 / 69 » Quantum Computation and Lattice Problems |
FOCS
2002
IEEE
13 years 10 months ago
2002
IEEE
We present the first explicit connection between quantum computation and lattice problems. Namely, our main result is a solution to the Unique Shortest Vector Problem (SVP) under ...
EUROCRYPT
2011
Springer
12 years 8 months ago
2011
Springer
Abstract. NTRUEncrypt, proposed in 1996 by Hostein, Pipher and Silverman, is the fastest known lattice-based encryption scheme. Its moderate key-sizes, excellent asymptotic perfor...
FOCS
2003
IEEE
13 years 10 months ago
2003
IEEE
We consider coGapSV P√ n, a gap version of the shortest vector in a lattice problem. This problem is known to be in AM ∩coNP but is not known to be in NP or in MA. We prove th...
IACR
2011
12 years 4 months ago
2011
We give direct constructions of pseudorandom function (PRF) families based on conjectured hard lattice problems and learning problems. Our constructions are asymptotically effici...
AIEDAM
2008
13 years 5 months ago
2008
We demonstrate the use of genetic programming in the automatic invention of quantum computing circuits that solve problems of potential theoretical and practical significance. We ...