COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers
From MaRDI portal
Recommendations
- Arbitrary-centered discrete Gaussian sampling over the integers
- FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers
- Gaussian sampling over the integers: efficient, generic, constant-time
- Discrete Ziggurat: a time-memory trade-off for sampling from a Gaussian distribution over the integers
- A constant-time sampling algorithm for binary Gaussian distribution over the integers
- On the rejection rate of exact sampling algorithm for discrete Gaussian distributions over the integers
- An efficient and parallel Gaussian sampler for lattices
- Sampling from arbitrary centered discrete Gaussians for lattice-based cryptography
- Faster Gaussian lattice sampling using lazy floating-point arithmetic
- High-Performance Constant-Time Discrete Gaussian Sampling
Cites work
- An efficient and parallel Gaussian sampler for lattices
- CDT-based Gaussian Sampling: From Multi to Double Precision
- Efficient identity-based encryption over NTRU lattices
- FACCT: FAst, Compact, and Constant-Time Discrete Gaussian Sampler over Integers
- Faster Gaussian lattice sampling using lazy floating-point arithmetic
- Gaussian sampling over the integers: efficient, generic, constant-time
- scientific article; zbMATH DE number 3954145 (Why is no real title available?)
- scientific article; zbMATH DE number 3564899 (Why is no real title available?)
- scientific article; zbMATH DE number 3070115 (Why is no real title available?)
- Improved security proofs in lattice-based cryptography: using the Rényi divergence rather than the statistical distance
- Lattice signatures and bimodal Gaussians
- Practical implementation of Ring-SIS/LWE based signature and IBE
- Rounded Gaussians -- fast and secure constant-time sampling for lattice-based crypto
- Sampling exactly from the normal distribution
- Sampling from arbitrary centered discrete Gaussians for lattice-based cryptography
- Sharper bounds in lattice-based cryptography using the Rényi divergence
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
Cited in
(10)- Arbitrary-centered discrete Gaussian sampling over the integers
- A constant-time sampling algorithm for binary Gaussian distribution over the integers
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus
- Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling
- Discrete Ziggurat: a time-memory trade-off for sampling from a Gaussian distribution over the integers
- Isochronous Gaussian sampling: from inception to implementation
- Sampling from arbitrary centered discrete Gaussians for lattice-based cryptography
- How to sample a discrete Gaussian (and more) from a random oracle
- Lattice-based zero-knowledge proofs in action: applications to electronic voting
- Lattice-based proof of shuffle and applications to electronic voting
This page was built for publication: COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041226)
