Generating Shorter Bases for Hard Random Lattices

Joël Alwen, Chris Peikert. Generating Shorter Bases for Hard Random Lattices. In Susanne Albers, Jean-Yves Marion, editors, 26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings. Volume 09001 of Dagstuhl Seminar Proceedings, pages 75-86, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2009. [doi]

@inproceedings{AlwenP09,
  title = {Generating Shorter Bases for Hard Random Lattices},
  author = {Joël Alwen and Chris Peikert},
  year = {2009},
  url = {http://drops.dagstuhl.de/opus/volltexte/2009/1832},
  researchr = {https://researchr.org/publication/AlwenP09},
  cites = {0},
  citedby = {0},
  pages = {75-86},
  booktitle = {26th International Symposium on Theoretical Aspects of Computer Science, STACS 2009, February 26-28, 2009, Freiburg, Germany, Proceedings},
  editor = {Susanne Albers and Jean-Yves Marion},
  volume = {09001},
  series = {Dagstuhl Seminar Proceedings},
  publisher = {Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  isbn = {978-3-939897-09-5},
}