On the rejection rate of exact sampling algorithm for discrete Gaussian distributions over the integers

DOI10.1007/s00224-022-10102-yzbMath1504.65008OpenAlexW4302286623MaRDI QIDQ2095466

Yusong Du, Xi-Ao Ma

Publication date: 16 November 2022

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00224-022-10102-y

zbMATH Keywords

random number generationexact samplingrejection samplingdiscrete Gaussian distribution

Mathematics Subject Classification ID

Sampling theory, sample surveys (62D05) Random number generation in numerical analysis (65C10) Sampling theory in information and communication theory (94A20)

Uses Software

• BLISS
• GALATICS

Cites Work

• Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
• Gaussian sampling over the integers: efficient, generic, constant-time
• Flush, Gauss, and reload -- a cache attack on the BLISS lattice-based signature scheme
• Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
• Sharper bounds in lattice-based cryptography using the Rényi divergence
• Sampling Exactly from the Normal Distribution
• Lattice Signatures and Bimodal Gaussians
• Trapdoors for hard lattices and new cryptographic constructions
• An Efficient and Parallel Gaussian Sampler for Lattices
• On Practical Discrete Gaussian Samplers for Lattice-Based Cryptography
• Public-key cryptosystems from the worst-case shortest vector problem
• On Ideal Lattices and Learning with Errors over Rings
• Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: On the rejection rate of exact sampling algorithm for discrete Gaussian distributions over the integers