Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time

Daniele Micciancio, Michael Walter 0001. Gaussian Sampling over the Integers: Efficient, Generic, Constant-Time. In Jonathan Katz, Hovav Shacham, editors, Advances in Cryptology - CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20-24, 2017, Proceedings, Part II. Volume 10402 of Lecture Notes in Computer Science, pages 455-485, Springer, 2017. [doi]

Abstract

Abstract is missing.

  翻译: