A constant-time sampling algorithm for binary Gaussian distribution over the integers

DOI10.1016/j.ipl.2022.106246zbMath1486.94096OpenAlexW4206929226WikidataQ114167093 ScholiaQ114167093MaRDI QIDQ2122792

Baoying Fan, Yusong Du, Baodian Wei

Publication date: 7 April 2022

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2022.106246

zbMATH Keywords

cryptographyrandomized algorithmstiming attackdiscrete Gaussian samplingbinary Gaussian distribution

Mathematics Subject Classification ID

Gaussian processes (60G15) Cryptography (94A60) Measures of information, entropy (94A17) Randomized algorithms (68W20)

Uses Software

• BLISS
• GAUSSIAN
• GALATICS
• FACCT

Cites Work

• Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
• Gaussian sampling over the integers: efficient, generic, constant-time
• 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
• Lattice Signatures and Bimodal Gaussians
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• High Precision Discrete Gaussian Sampling on FPGAs
• An Efficient and Parallel Gaussian Sampler for Lattices
• Constant-Time Discrete Gaussian Sampling
• On Practical Discrete Gaussian Samplers for Lattice-Based Cryptography
• Gaussian Sampling in Lattice Based Cryptography
• FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers

This page was built for publication: A constant-time sampling algorithm for binary Gaussian distribution over the integers