October 01, 2015 conference-paper Open access Solving the Closest Vector Problem in 2^n Time -- The Discrete Gaussian Strikes Again! Annual Symposium on Foundations of Computer Science DOI: 10.1109/focs.2015.41 Full text (OA) OpenAlex Authors 0 Author list not loaded yet. Cited by 2 stored of 66 Search Sort Most cited Newest Oldest Patent citations Title Any typearticle review book-chapter conference-paper preprint dissertation book dataset other Any fieldAgricultural and Biological Sciences Arts and Humanities Biochemistry, Genetics and Molecular Biology Business, Management and Accounting Chemical Engineering Chemistry Computer Science Decision Sciences Dentistry Earth and Planetary Sciences Economics, Econometrics and Finance Energy Engineering Environmental Science Health Professions Immunology and Microbiology Materials Science Mathematics Medicine Neuroscience Nursing Pharmacology, Toxicology and Pharmaceutics Physics and Astronomy Psychology Social Sciences Veterinary Open access Wagner’s Algorithm Provably Runs in Subexponential Time for $$\textrm{SIS}^\infty $$ 2025 Lecture notes in computer science conference-paper Computer Science Cryptography and Data Security Open access 2 citations Provable lattice reduction of $$\mathbb {Z}^n$$ with blocksize n/2 2023 Designs Codes and Cryptography article Computer Science Cryptography and Data Security Open access 9 citations 2 results References 0