On the rejection rate of exact sampling algorithm for discrete Gaussian distributions over the integers
From MaRDI portal
Publication:2095466
Recommendations
- Arbitrary-centered discrete Gaussian sampling over the integers
- A constant-time sampling algorithm for binary Gaussian distribution over the integers
- Discrete Ziggurat: a time-memory trade-off for sampling from a Gaussian distribution over the integers
- Sampling exactly from the normal distribution
- Gaussian sampling over the integers: efficient, generic, constant-time
Cites work
- An efficient and parallel Gaussian sampler for lattices
- Flush, Gauss, and reload -- a cache attack on the BLISS lattice-based signature scheme
- Gaussian sampling over the integers: efficient, generic, constant-time
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Lattice signatures and bimodal Gaussians
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On Practical Discrete Gaussian Samplers for Lattice-Based Cryptography
- Public-key cryptosystems from the worst-case shortest vector problem
- Sampling exactly from the normal distribution
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
- Sharper bounds in lattice-based cryptography using the Rényi divergence
- Trapdoors for hard lattices and new cryptographic constructions
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(3)
This page was built for publication: On the rejection rate of exact sampling algorithm for discrete Gaussian distributions over the integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2095466)
