Author:
Gama Nicolas,Howgrave-Graham Nick,Koy Henrik,Nguyen Phong Q.
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. Ajtai, M.: The worst-case behavior of Schnorr’s algorithm approximating the shortest nonzero vector in a lattice. In: Proceedings of the Thirty-Fifth Annual ACM Symposium on Theory of Computing (electronic), pp. 396–406. ACM Press, New York (2003)
2. Ajtai, M., Kumar, R., Sivakumar, D.: A sieve algorithm for the shortest lattice vector problem. In: Proc. 33rd STOC, pp. 601–610. ACM Press, New York (2001)
3. Boguslavsky, M.I.: Radon transforms and packings. Discrete Appl. Math. 111(1-2), 3–22 (2001)
4. Boneh, D.: Twenty years of attacks on the RSA cryptosystem. Notices of the AMS 46(2), 203–213 (1999)
5. Lecture Notes in Computer Science;D. Boneh,1999
Cited by
27 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Lattice-Aided Delay Phase Precoding for 6G THz Massive MIMO;Advances in Information Security, Privacy, and Ethics;2024-06-28
2. Subfield Attacks on HSVP in Ideal Lattices;Information Security and Cryptology;2023
3. Sharper bounds on four lattice constants;Designs, Codes and Cryptography;2022-05-09
4. On the Smallest Ratio Problem of Lattice Bases;Proceedings of the 2021 on International Symposium on Symbolic and Algebraic Computation;2021-07-18
5. Three Strategies for Improving Shortest Vector Enumeration Using GPUs;Scientific Programming;2021-01-05