Gaussian sampling of lattices for cryptographic applications
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1088230 (Why is no real title available?)
- scientific article; zbMATH DE number 1962147 (Why is no real title available?)
- scientific article; zbMATH DE number 2009972 (Why is no real title available?)
- scientific article; zbMATH DE number 1445397 (Why is no real title available?)
- A Group Signature Scheme from Lattice Assumptions
- An efficient and parallel Gaussian sampler for lattices
- Bonsai trees, or how to delegate a lattice basis
- Efficient lattice (H)IBE in the standard model
- Lattice-based blind signatures
- Lattice-based linearly homomorphic signature scheme over binary field
- Learning a Parallelepiped: Cryptanalysis of GGH and NTRU Signatures
- NTRUSign With a New Perturbation
- On Lovász' lattice reduction and the nearest lattice point problem
- Strongly unforgeable signatures and hierarchical identity-based signatures from lattices without random oracles
- Trapdoors for hard lattices and new cryptographic constructions
Cited in
(11)- Practical Applications of Improved Gaussian Sampling for Trapdoor Lattices
- On Gaussian sampling, smoothing parameter and application to signatures
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus
- Discrete Gaussian sampling reduces to CVP and SVP
- Quadratic time, linear space algorithms for Gram-Schmidt orthogonalization and Gaussian sampling in structured lattices
- An efficient and parallel Gaussian sampler for lattices
- Efficiently masking binomial sampling at arbitrary orders for lattice-based crypto
- Faster Gaussian lattice sampling using lazy floating-point arithmetic
- Building an efficient lattice gadget toolkit: Subgaussian sampling and more
- Gaussian Sampling in Lattice Based Cryptography
- Simple Lattice Trapdoor Sampling from a Broad Class of Distributions
This page was built for publication: Gaussian sampling of lattices for cryptographic applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q893724)