Lower Bounds on Lattice Enumeration with Extreme Pruning

Yoshinori Aono, Phong Q. Nguyen, Takenobu Seito, Junji Shikata. Lower Bounds on Lattice Enumeration with Extreme Pruning. In Hovav Shacham, Alexandra Boldyreva, editors, Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II. Volume 10992 of Lecture Notes in Computer Science, pages 608-637, Springer, 2018. [doi]

@inproceedings{AonoNSS18-0,
  title = {Lower Bounds on Lattice Enumeration with Extreme Pruning},
  author = {Yoshinori Aono and Phong Q. Nguyen and Takenobu Seito and Junji Shikata},
  year = {2018},
  doi = {10.1007/978-3-319-96881-0_21},
  url = {https://doi.org/10.1007/978-3-319-96881-0_21},
  researchr = {https://researchr.org/publication/AonoNSS18-0},
  cites = {0},
  citedby = {0},
  pages = {608-637},
  booktitle = {Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II},
  editor = {Hovav Shacham and Alexandra Boldyreva},
  volume = {10992},
  series = {Lecture Notes in Computer Science},
  publisher = {Springer},
  isbn = {978-3-319-96881-0},
}