Author:
Ding Jintai,Gao Xinwei,Takagi Tsuyoshi,Wang Yuntao
Publisher
Springer International Publishing
Reference39 articles.
1. Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proceedings of the Thirty-Third Annual ACM Symposium on Theory of Computing, STOC 2001, pp. 601–610 (2001)
2. Lecture Notes in Computer Science;MR Albrecht,2017
3. Lecture Notes in Computer Science;MR Albrecht,2017
4. Albrecht, M.R., Player, R., Scott, S.: On the concrete hardness of learning with errors. J. Math. Cryptol. 9(3), 169–203 (2015)
5. Alkim, E., Ducas, L., Pöppelmann, T., Schwabe, P.: NewHope without reconciliation. IACR Cryptology ePrint Archive 2016, 1157 (2016).
http://eprint.iacr.org/2016/1157
Cited by
7 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献