Publisher
Springer Nature Switzerland
Reference47 articles.
1. Lattice Attacks on NTRU and LWE: A History of Refinements, p. 15-40. London Mathematical Society Lecture Note Series, Cambridge University Press (2021)
2. Aggarwal, D., Chen, Y., Kumar, R., Shen, Y.: Improved classical and quantum algorithms for the shortest vector problem via bounded distance decoding (2020). https://arxiv.org/abs/2002.07955
3. Aggarwal, D., Chen, Y., Kumar, R., Shen, Y.: Improved (provable) algorithms for the shortest vector problem via bounded distance decoding. In: Bläser, M., Monmege, B. (eds.) 38th International Symposium on Theoretical Aspects of Computer Science, STACS 2021, Saarbrücken, Germany, 16–19 March 2021 (Virtual Conference). LIPIcs, vol. 187, pp. 4:1–4:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021). https://doi.org/10.4230/LIPIcs.STACS.2021.4
4. Aggarwal, D., Dadush, D., Regev, O., Stephens-Davidowitz, N.: Solving the shortest vector problem in 2$$^{\rm n}$$ time using discrete gaussian sampling: Extended abstract. In: Servedio, R.A., Rubinfeld, R. (eds.) Proceedings of the Forty-Seventh Annual ACM on Symposium on Theory of Computing, STOC 2015, Portland, OR, USA, 14–17 June 2015, pp. 733–742. ACM (2015). https://doi.org/10.1145/2746539.2746606
5. Aharonov, D., Regev, O.: Lattice problems in np $$\cap $$ conp. J. ACM 52(5), 749–765 (2005). https://doi.org/10.1145/1089023.1089025
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献