Faster Gaussian lattice sampling using lazy floating-point arithmetic
From MaRDI portal
Recommendations
- Integral matrix Gram root and lattice Gaussian sampling without floats
- Gaussian sampling over the integers: efficient, generic, constant-time
- An efficient and parallel Gaussian sampler for lattices
- Gaussian Sampling in Lattice Based Cryptography
- Gaussian sampling of lattices for cryptographic applications
Cited in
(17)- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Gaussian sampling over the integers: efficient, generic, constant-time
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices
- Exact lattice sampling from non-Gaussian distributions
- Integral matrix Gram root and lattice Gaussian sampling without floats
- How to meet ternary LWE keys
- Sampling the integers with low relative error
- Building an efficient lattice gadget toolkit: Subgaussian sampling and more
- Fast automatic Bayesian cubature using lattice sampling
- Quadratic time, linear space algorithms for Gram-Schmidt orthogonalization and Gaussian sampling in structured lattices
- Isochronous Gaussian sampling: from inception to implementation
- COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers
- Sampling from arbitrary centered discrete Gaussians for lattice-based cryptography
- \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple
- Do not disturb a sleeping Falcon. Floating-point error sensitivity of the Falcon sampler and its consequences
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device
- PASS-encrypt: a public key cryptosystem based on partial evaluation of polynomials
This page was built for publication: Faster Gaussian lattice sampling using lazy floating-point arithmetic
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4911599)
