Algorithms for the Shortest and Closest Lattice Vector Problems

Guillaume Hanrot, Xavier Pujol, Damien Stehlé. Algorithms for the Shortest and Closest Lattice Vector Problems. In Yeow Meng Chee, Zhenbo Guo, San Ling, Fengjing Shao, Yuansheng Tang, Huaxiong Wang, Chaoping Xing, editors, Coding and Cryptology - Third International Workshop, IWCC 2011, Qingdao, China, May 30-June 3, 2011. Proceedings. Volume 6639 of Lecture Notes in Computer Science, pages 159-190, Springer, 2011. [doi]

@inproceedings{HanrotPS11-0,
  title = {Algorithms for the Shortest and Closest Lattice Vector Problems},
  author = {Guillaume Hanrot and Xavier Pujol and Damien Stehlé},
  year = {2011},
  doi = {10.1007/978-3-642-20901-7_10},
  url = {http://dx.doi.org/10.1007/978-3-642-20901-7_10},
  researchr = {https://researchr.org/publication/HanrotPS11-0},
  cites = {0},
  citedby = {0},
  pages = {159-190},
  booktitle = {Coding and Cryptology - Third International Workshop, IWCC 2011, Qingdao, China, May 30-June 3, 2011. Proceedings},
  editor = {Yeow Meng Chee and Zhenbo Guo and San Ling and Fengjing Shao and Yuansheng Tang and Huaxiong Wang and Chaoping Xing},
  volume = {6639},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-20900-0},
}