Sampling from arbitrary centered discrete Gaussians for lattice-based cryptography
From MaRDI portal
Recommendations
- Arbitrary-centered discrete Gaussian sampling over the integers
- COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers
- Gaussian Sampling in Lattice Based Cryptography
- A constant-time sampling algorithm for binary Gaussian distribution over the integers
- Discrete Ziggurat: a time-memory trade-off for sampling from a Gaussian distribution over the integers
Cites work
- A decade of lattice cryptography
- A Fast, Easily Implemented Method for Sampling from Decreasing or Symmetric Unimodal Density Functions
- An efficient and parallel Gaussian sampler for lattices
- Asymptotically Efficient Lattice-Based Digital Signatures
- 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
- Fiat-Shamir with aborts: applications to lattice and factoring-based signatures
- Generalized compact knapsacks, cyclic lattices, and efficient one-way functions
- How To Prove Yourself: Practical Solutions to Identification and Signature Problems
- scientific article; zbMATH DE number 3954145 (Why is no real title available?)
- scientific article; zbMATH DE number 3614066 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1088230 (Why is no real title available?)
- scientific article; zbMATH DE number 1445397 (Why is no real title available?)
- Implementing candidate graded encoding schemes from ideal lattices
- Lattice signatures and bimodal Gaussians
- Lattice signatures without trapdoors
- Lattice-Based Identification Schemes Secure Under Active Attacks
- MPFR
- On ideal lattices and learning with errors over rings
- On lattices, learning with errors, random linear codes, and cryptography
- On Lovász' lattice reduction and the nearest lattice point problem
- Rigorous and Efficient Short Lattice Vectors Enumeration
- Sampling exactly from the normal distribution
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
- Trapdoors for hard lattices and new cryptographic constructions
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(8)- Arbitrary-centered discrete Gaussian sampling over the integers
- Efficiently masking binomial sampling at arbitrary orders for lattice-based crypto
- Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
- COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers
- Fast Discretized Gaussian Sampling and Post-quantum TLS Ciphersuite
- Gaussian Sampling in Lattice Based Cryptography
- Practical Applications of Improved Gaussian Sampling for Trapdoor Lattices
- How to sample a discrete Gaussian (and more) from a random oracle
This page was built for publication: Sampling from arbitrary centered discrete Gaussians for lattice-based cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5086199)
