An improved exact sampling algorithm for the standard normal distribution
From MaRDI portal
Publication:2135885
DOI10.1007/s00180-021-01136-wzbMath1505.62132arXiv2008.03855OpenAlexW3185364777MaRDI QIDQ2135885
Yusong Du, Baodian Wei, Baoying Fan
Publication date: 10 May 2022
Published in: Computational Statistics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2008.03855
Computational methods for problems pertaining to statistics (62-08) Cryptography (94A60) Random number generation in numerical analysis (65C10)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
- Gaussian sampling over the integers: efficient, generic, constant-time
- The expected bit complexity of the von Neumann rejection algorithm
- Sampling Exactly from the Normal Distribution
- Trapdoors for hard lattices and new cryptographic constructions
- The complexity of generating an exponentially distributed variate
- FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
This page was built for publication: An improved exact sampling algorithm for the standard normal distribution