On the complexity of computing short linearly independent vectors and short bases in a lattice
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Approximating minimum unsatisfiability of linear equations
SODA '02 Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms
Approximability of Dense Instances of NEAREST CODEWORD Problem
SWAT '02 Proceedings of the 8th Scandinavian Workshop on Algorithm Theory
Approximation Hardness of Bounded Degree MIN-CSP and MIN-BISECTION
ICALP '02 Proceedings of the 29th International Colloquium on Automata, Languages and Programming
Closest Vectors, Successive Minima, and Dual HKZ-Bases of Lattices
ICALP '00 Proceedings of the 27th International Colloquium on Automata, Languages and Programming
Cryptanalysis of the Goldreich-Goldwasser-Halevi Cryptosystem from Crypto '97
CRYPTO '99 Proceedings of the 19th Annual International Cryptology Conference on Advances in Cryptology
Approximating Bounded Degree Instances of NP-Hard Problems
FCT '01 Proceedings of the 13th International Symposium on Fundamentals of Computation Theory
Approximating SVPinfty to within Almost-Polynomial Factors Is NP-Hard
CIAC '00 Proceedings of the 4th Italian Conference on Algorithms and Complexity
Improving Lattice Based Cryptosystems Using the Hermite Normal Form
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
The Two Faces of Lattices in Cryptology
CaLC '01 Revised Papers from the International Conference on Cryptography and Lattices
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction
Random Structures & Algorithms
ACM Transactions on Algorithms (TALG)
Hardness of approximating the shortest vector problem in lattices
Journal of the ACM (JACM)
Efficient lattice-based signature scheme
International Journal of Applied Cryptography
Sampling methods for shortest vectors, closest vectors and successive minima
Theoretical Computer Science
A new transference theorem in the geometry of numbers
COCOON'99 Proceedings of the 5th annual international conference on Computing and combinatorics
Hypercubic lattice reduction and analysis of GGH and NTRU signatures
EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques
A digital signature scheme based on CV P∞
PKC'08 Proceedings of the Practice and theory in public key cryptography, 11th international conference on Public key cryptography
Hardness of approximation results for the problem of finding the stopping distance in tanner graphs
FSTTCS'06 Proceedings of the 26th international conference on Foundations of Software Technology and Theoretical Computer Science
Efficient collision-resistant hashing from worst-case assumptions on cyclic lattices
TCC'06 Proceedings of the Third conference on Theory of Cryptography
| Hi-index | 0.00 |
This paper shows the closest vector in a lattice to be NP-hard to approximate to within any factor up to $2^{(\log{n})^{1-\epsilon}}$ where $\epsilon = (\log\log{n})^{-c} $ for any constant $c