Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search

Thijs Laarhoven, Michele Mosca, Joop van de Pol. Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search. In Philippe Gaborit, editor, Post-Quantum Cryptography - 5th International Workshop, PQCrypto 2013, Limoges, France, June 4-7, 2013. Proceedings. Volume 7932 of Lecture Notes in Computer Science, pages 83-101, Springer, 2013. [doi]

@inproceedings{LaarhovenMP13,
  title = {Solving the Shortest Vector Problem in Lattices Faster Using Quantum Search},
  author = {Thijs Laarhoven and Michele Mosca and Joop van de Pol},
  year = {2013},
  doi = {10.1007/978-3-642-38616-9_6},
  url = {http://dx.doi.org/10.1007/978-3-642-38616-9_6},
  researchr = {https://researchr.org/publication/LaarhovenMP13},
  cites = {0},
  citedby = {0},
  pages = {83-101},
  booktitle = {Post-Quantum Cryptography - 5th International Workshop, PQCrypto 2013, Limoges, France, June 4-7, 2013. Proceedings},
  editor = {Philippe Gaborit},
  volume = {7932},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-642-38615-2},
}