An Efficient and Parallel Gaussian Sampler for Lattices
From MaRDI portal
Publication:3582749
DOI10.1007/978-3-642-14623-7_5zbMath1280.94091OpenAlexW2140256428MaRDI QIDQ3582749
Publication date: 24 August 2010
Published in: Advances in Cryptology – CRYPTO 2010 (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-14623-7_5
Related Items
A constant-time sampling algorithm for binary Gaussian distribution over the integers ⋮ On the hardness of module-LWE with binary secret ⋮ Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography ⋮ Isochronous Gaussian Sampling: From Inception to Implementation ⋮ COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers ⋮ Fast Discretized Gaussian Sampling and Post-quantum TLS Ciphersuite ⋮ Fully Homomorphic Encryption with Auxiliary Inputs ⋮ On the higher-bit version of approximate inhomogeneous short integer solution problem ⋮ Gadget-based iNTRU lattice trapdoors ⋮ Faster Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ Non-commutative ring learning with errors from cyclic algebras ⋮ A note on the concrete hardness of the shortest independent vector in lattices ⋮ Batch-OT with optimal rate ⋮ \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon} ⋮ On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography ⋮ Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography ⋮ Towards a Simpler Lattice Gadget Toolkit ⋮ Discrete Gaussian measures and new bounds of the smoothing parameter for lattices ⋮ Bonsai trees, or how to delegate a lattice basis ⋮ On the hardness of module learning with errors with short distributions ⋮ Improved power analysis attacks on Falcon ⋮ Efficient laconic cryptography from learning with errors ⋮ Hardness of \(k\)-LWE and applications in traitor tracing ⋮ Sender-binding key encapsulation ⋮ Gaussian sampling of lattices for cryptographic applications ⋮ Shorter hash-and-sign lattice-based signatures ⋮ \textsc{Hawk}: module LIP makes lattice signatures fast, compact and simple ⋮ On the hardness of the NTRU problem ⋮ Compact lattice gadget and its applications to hash-and-sign signatures ⋮ Toward practical lattice-based proof of knowledge from Hint-MLWE ⋮ Almost tight multi-user security under adaptive corruptions from LWE in the standard model ⋮ Hardness of (M)LWE with semi-uniform seeds ⋮ Towards classical hardness of module-LWE: the linear rank case ⋮ Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling ⋮ Lattice-based completely non-malleable public-key encryption in the standard model ⋮ Provably secure NTRUEncrypt over any cyclotomic field ⋮ A lattice-based group signature scheme with verifier-local revocation ⋮ Improved (Hierarchical) Inner-Product Encryption from Lattices ⋮ Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices ⋮ Learning strikes again: the case of the DRS signature scheme ⋮ A Note on Discrete Gaussian Combinations of Lattice Vectors ⋮ Tighter security proofs for GPV-IBE in the quantum random oracle model ⋮ Lattice-based unidirectional infinite-use proxy re-signatures with private re-signature key ⋮ Better Key Sizes (and Attacks) for LWE-Based Encryption ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ Two-round \(n\)-out-of-\(n\) and multi-signatures and trapdoor commitment from lattices ⋮ Sampling from discrete Gaussians for lattice-based cryptography on a constrained device ⋮ Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices ⋮ Exact lattice sampling from non-Gaussian distributions ⋮ Identity-based encryption with security against the KGC: a formal model and its instantiations ⋮ The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs ⋮ FHE Circuit Privacy Almost for Free ⋮ A new Gaussian sampling for trapdoor lattices with arbitrary modulus ⋮ On the rejection rate of exact sampling algorithm for discrete Gaussian distributions over the integers ⋮ Rounding in the rings ⋮ Worst-case to average-case reductions for module lattices ⋮ Secure hybrid encryption in the standard model from hard learning problems ⋮ Hardness of LWE on general entropic distributions ⋮ Integral matrix Gram root and lattice Gaussian sampling without floats
Uses Software
