Improved Analysis of Kannan s Shortest Lattice Vector Algorithm

Guillaume Hanrot, Damien Stehlé. Improved Analysis of Kannan s Shortest Lattice Vector Algorithm. In Alfred Menezes, editor, Advances in Cryptology - CRYPTO 2007, 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007, Proceedings. Volume 4622 of Lecture Notes in Computer Science, pages 170-186, Springer, 2007. [doi]

@inproceedings{HanrotS07,
  title = {Improved Analysis of Kannan s Shortest Lattice Vector Algorithm},
  author = {Guillaume Hanrot and Damien Stehlé},
  year = {2007},
  doi = {10.1007/978-3-540-74143-5_10},
  url = {http://dx.doi.org/10.1007/978-3-540-74143-5_10},
  tags = {analysis},
  researchr = {https://researchr.org/publication/HanrotS07},
  cites = {0},
  citedby = {0},
  pages = {170-186},
  booktitle = {Advances in Cryptology - CRYPTO 2007, 27th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2007, Proceedings},
  editor = {Alfred Menezes},
  volume = {4622},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-540-74142-8},
}