Author:
Bambury Henry,Nguyen Phong Q.
Publisher
Springer Nature Switzerland
Reference47 articles.
1. Aggarwal, D., Dadush, D., Stephens-Davidowitz, N.: Solving the closest vector problem in $$2^n$$ time - the discrete gaussian strikes again!. In: Proceedings of the IEEE 56th FOCS, pp. 563–582 (2015)
2. Lecture Notes in Computer Science;D Aggarwal,2020
3. Aggarwal, D., Stephens-Davidowitz, N.: Just take the average! an embarrassingly simple $$2^n$$-time algorithm for SVP (and CVP). In: SOSA (2018). http://arxiv.org/abs/1709.01535
4. Albrecht, M.R., Ducas, L.: Lattice Attacks on NTRU and LWE: A History of Refinements, pp. 15–40. London Mathematical Society Lecture Note Series, Cambridge University Press (2021)
5. Lecture Notes in Computer Science;MR Albrecht,2017