A Secure Algorithm for Rounded Gaussian Sampling

DOI10.1007/978-3-030-65411-5_29MaRDI QIDQ6488039zbMATH OpenFDO

Authors Séamus Brannigan, Máire O'Neill, Ayesha Khalid, Ciara Rafferty

Publication date 22 March 2023

Full work available at URL https://doi.org/10.1007/978-3-030-65411-5_29

Mathematics Subject Classification ID

Cryptography (94A60) Sampling theory in information and communication theory (94A20) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Rounded Gaussians -- fast and secure constant-time sampling for lattice-based crypto
• Isochronous Gaussian sampling: from inception to implementation
• Gaussian Sampling in Lattice Based Cryptography
• An efficient and parallel Gaussian sampler for lattices
• Lattice signatures and bimodal Gaussians

Cites work

• A Note on the Generation of Random Normal Deviates
• A decade of lattice cryptography
• Constant-Time Discrete Gaussian Sampling
• FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers
• Flush, Gauss, and reload -- a cache attack on the BLISS lattice-based signature scheme
• Revocable Identity-Based Encryption from Lattices
• Rounded Gaussians -- fast and secure constant-time sampling for lattice-based crypto
• Security bounds for the design of code-based cryptosystems
• Trapdoors for hard lattices and new cryptographic constructions

Cited in

(5)

• Rounded Gaussians -- fast and secure constant-time sampling for lattice-based crypto
• On Gaussian sampling, smoothing parameter and application to signatures
• Isochronous Gaussian sampling: from inception to implementation
• An efficient and parallel Gaussian sampler for lattices
• On Invertible Sampling and Adaptive Security

This page was built for publication: A Secure Algorithm for Rounded Gaussian Sampling

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