Sampling the integers with low relative error

DOI10.1007/978-3-030-23696-0_9MaRDI QIDQ2177625zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 6 May 2020

Full work available at URL https://doi.org/10.1007/978-3-030-23696-0_9

zbMATH Keywords

discrete Gaussianslattice-based cryptographysampling

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Gaussian sampling over the integers: efficient, generic, constant-time
• Gaussian Sampling in Lattice Based Cryptography
• Arbitrary-centered discrete Gaussian sampling over the integers
• Discrete Ziggurat: a time-memory trade-off for sampling from a Gaussian distribution over the integers
• Faster Gaussian lattice sampling using lazy floating-point arithmetic

Cited in

(3)

• On sampling by index cases
• A constant-time sampling algorithm for binary Gaussian distribution over the integers
• Isochronous Gaussian sampling: from inception to implementation

This page was built for publication: Sampling the integers with low relative error

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2177625)