An Improved Exact Sampling Algorithm for the Standard Normal Distribution

Various techniques used in connection with random digits

John von Neumann · 1951

Earlier work this paper cites.

Algorithms and Complexity: New Directions and Recent Results

D. Knuth and A. Yao · 1976

Earlier work this paper cites.

Non-Uniform Random Variate Generation

Luc Devroye · 1986

Earlier work this paper cites.

The complexity of generating an exponentially distributed variate

Philippe Flajolet and Nasser Saheb · 1986

Earlier work this paper cites.

Trapdoors for hard lattices and new cryptographic constructions

Craig Gentry, Chris Peikert, and Vinod Vaikuntanathan · 2008

Cited alongside, same era.

Sampling from discrete gaussians for lattice-based cryptography on a constrained device

Nagarjun C. Dwarakanath and Steven D. Galbraith · 2014

Cited alongside, same era.

Sampling exactly from the normal distribution

Charles F. Karney · 2016

Cited alongside, same era.

The expected bit complexity of the von neumann rejection algorithm

Luc Devroye and Claude Gravel · 2017

Later among the works it cites.

Gaussian sampling over the integers: Efficient, generic, constant-time

Daniele Micciancio and Michael Walter · 2017

Later among the works it cites.

FACCT: fast, compact, and constant-time discrete gaussian sampler over integers

Raymond K. Zhao, Ron Steinfeld, and Amin Sakzad · 2020

Closest in time.