5

In lattice cryptography, we always face the probem of discrete gaussian sampling. To the beginners, it is a bit complex. However, gaussian sampling from a continous space is much easier to understand, and a lot of tools are available. Say, we can use MATLAB to do gaussian sampling very efficiently. So, I want to know what is the difference between the following to process:

(1) discrete-then-gaussian: Just as required is many lattice cryptography papers.

(2) gaussian-then-discrete: At first, get continous gaussian samples, say by using MATLAB, and then perform nearest rounding operations, i.e., discrete to the nearest integers.

Licheng Wang
  • 313
  • 1
  • 7

1 Answers1

1

I've seen a paper that may be related to this question. In following a short paragraph of this paper, explains about $\color{blue}{discrete}$ Gaussian distribution and the $\color{blue}{discretized}$ Gaussian distribution.

Reference: [Daniele Micciancio, Petros Mol. "Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions," In Crypto 2011, IACR 2011/521]

enter image description here

user1035648
  • 673
  • 5
  • 14