Solving the Shortest Vector Problem in 2 n Time Using Discrete Gaussian Sampling-Reference-Cited by-同舟云学术

Solving the Shortest Vector Problem in 2 n Time Using Discrete Gaussian Sampling

Published:2015-06-14 Issue: Volume: Page:
ISSN:
Container-title:Proceedings of the forty-seventh annual ACM symposium on Theory of Computing
language:
Short-container-title:

Author:

Aggarwal Divesh¹,Dadush Daniel²,Regev Oded³,Stephens-Davidowitz Noah³

Affiliation:

1. École polytechnique fédérale de Lausanne, Lausanne, Switzerland

2. Centrum Wiskunde & Informatica, Amsterdam, Netherlands

3. New York University, New York, NY, USA

Funder

Simons Foundation

National Science Foundation

Publisher

ACM

Link

https://dl.acm.org/doi/pdf/10.1145/2746539.2746606

Reference49 articles.

1. D. Aggarwal D. Dadush O. Regev and N. Stephens-Davidowitz. Solving the Shortest Vector Problem in 2n time via discrete Gaussian sampling. http://arxiv.org/abs/1412.7994. D. Aggarwal D. Dadush O. Regev and N. Stephens-Davidowitz. Solving the Shortest Vector Problem in 2n time via discrete Gaussian sampling. http://arxiv.org/abs/1412.7994.

2. Quad;Ajtai M.,2004

3. A sieve algorithm for the shortest lattice vector problem

4. New bounds in some transference theorems in the geometry of numbers

Cited by 60 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Feasibility of Circuit Polynomials without Purple Swans: Feasibility without Purple Swans;Proceedings of the 2024 International Symposium on Symbolic and Algebraic Computation;2024-07-16

2. Constrained inhomogeneous spherical equations: average-case hardness;journal of Groups, complexity, cryptology;2024-07-09

3. Provable Dual Attacks on Learning with Errors;Lecture Notes in Computer Science;2024

4. CryptAttackTester: high-assurance attack analysis;Lecture Notes in Computer Science;2024

5. Provable lattice reduction of $$\mathbb {Z}^n$$ with blocksize n/2;Designs, Codes and Cryptography;2023-11-11