Discrete Gaussian Sampling Reduces to CVP and SVP
From MaRDI portal
Publication:4575705
DOI10.1137/1.9781611974331.ch121zbMath1410.68175arXiv1506.07490OpenAlexW2282554529MaRDI QIDQ4575705
Publication date: 16 July 2018
Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1506.07490
Analysis of algorithms and problem complexity (68Q25) Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)
Related Items (5)
Approximate CVP in time \(2^{0.802 n}\) -- now in any norm! ⋮ Improved analysis of the reduction from BDD to uSVP ⋮ Just how hard are rotations of \(\mathbb{Z}^n\)? Algorithms and cryptography with the simplest lattice ⋮ Revisiting the Sparsification Technique in Kannan’s Embedding Attack on LWE ⋮ Hardness of bounded distance decoding on lattices in lp norms
This page was built for publication: Discrete Gaussian Sampling Reduces to CVP and SVP
