Lyubashevsky, V., & Micciancio, D. (2009). On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem. Advances in Cryptology - CRYPTO 2009, 577. https://doi.org/10.1007/978-3-642-03356-8_34
Chicago Style (17th ed.) CitationLyubashevsky, Vadim, and Daniele Micciancio. "On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem." Advances in Cryptology - CRYPTO 2009 2009: 577. https://doi.org/10.1007/978-3-642-03356-8_34.
MLA (9th ed.) CitationLyubashevsky, Vadim, and Daniele Micciancio. "On Bounded Distance Decoding, Unique Shortest Vectors, and the Minimum Distance Problem." Advances in Cryptology - CRYPTO 2009, 2009, p. 577, https://doi.org/10.1007/978-3-642-03356-8_34.
Warning: These citations may not always be 100% accurate.