Pages that link to "Item:Q3582749"
From MaRDI portal
The following pages link to An Efficient and Parallel Gaussian Sampler for Lattices (Q3582749):
Displaying 50 items.
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device (Q742507) (← links)
- On the hardness of module-LWE with binary secret (Q826282) (← links)
- Gaussian sampling of lattices for cryptographic applications (Q893724) (← links)
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus (Q1648788) (← links)
- Hardness of \(k\)-LWE and applications in traitor tracing (Q1688407) (← links)
- Provably secure NTRUEncrypt over any cyclotomic field (Q1726689) (← links)
- A lattice-based group signature scheme with verifier-local revocation (Q1749538) (← links)
- Bonsai trees, or how to delegate a lattice basis (Q1928766) (← links)
- Enhancing Goldreich, Goldwasser and Halevi's scheme with intersecting lattices (Q2009415) (← links)
- Lattice-based unidirectional infinite-use proxy re-signatures with private re-signature key (Q2037197) (← links)
- Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices (Q2055645) (← links)
- Exact lattice sampling from non-Gaussian distributions (Q2061936) (← links)
- Identity-based encryption with security against the KGC: a formal model and its instantiations (Q2062134) (← links)
- On the rejection rate of exact sampling algorithm for discrete Gaussian distributions over the integers (Q2095466) (← links)
- Rounding in the rings (Q2096527) (← links)
- Secure hybrid encryption in the standard model from hard learning problems (Q2118559) (← links)
- Hardness of LWE on general entropic distributions (Q2119024) (← links)
- Integral matrix Gram root and lattice Gaussian sampling without floats (Q2119026) (← links)
- A constant-time sampling algorithm for binary Gaussian distribution over the integers (Q2122792) (← links)
- On the higher-bit version of approximate inhomogeneous short integer solution problem (Q2149828) (← links)
- Gadget-based iNTRU lattice trapdoors (Q2152053) (← links)
- Non-commutative ring learning with errors from cyclic algebras (Q2154559) (← links)
- Batch-OT with optimal rate (Q2170043) (← links)
- \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon} (Q2170090) (← links)
- On the lattice isomorphism problem, quadratic forms, remarkable lattices, and cryptography (Q2170105) (← links)
- Building an efficient lattice gadget toolkit: Subgaussian sampling and more (Q2292888) (← links)
- Fast automatic Bayesian cubature using lattice sampling (Q2302451) (← links)
- A new Gaussian sampling for trapdoor lattices with arbitrary modulus (Q2329396) (← links)
- Worst-case to average-case reductions for module lattices (Q2345928) (← links)
- Lattice-based completely non-malleable public-key encryption in the standard model (Q2448075) (← links)
- A note on the concrete hardness of the shortest independent vector in lattices (Q2656338) (← links)
- Discrete Gaussian measures and new bounds of the smoothing parameter for lattices (Q2666966) (← links)
- On the hardness of module learning with errors with short distributions (Q2677644) (← links)
- Towards classical hardness of module-LWE: the linear rank case (Q2692385) (← links)
- Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling (Q2701491) (← links)
- The Whole is Less Than the Sum of Its Parts: Constructing More Efficient Lattice-Based AKEs (Q2827724) (← links)
- FHE Circuit Privacy Almost for Free (Q2829211) (← links)
- Simple Lattice Trapdoor Sampling from a Broad Class of Distributions (Q2941217) (← links)
- Better Key Sizes (and Attacks) for LWE-Based Encryption (Q3073715) (← links)
- (Q3141820) (← links)
- A Note on Discrete Gaussian Combinations of Lattice Vectors (Q3187176) (← links)
- Fully Homomorphic Encryption with Auxiliary Inputs (Q3454587) (← links)
- A fast lattice algorithm for PARCOR parameter estimation based on an approximate likelihood (Q3691045) (← links)
- Improved (Hierarchical) Inner-Product Encryption from Lattices (Q4916012) (← links)
- Improved Discrete Gaussian and Subgaussian Analysis for Lattice Cryptography (Q5041172) (← links)
- Isochronous Gaussian Sampling: From Inception to Implementation (Q5041213) (← links)
- COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers (Q5041226) (← links)
- Fast Discretized Gaussian Sampling and Post-quantum TLS Ciphersuite (Q5056039) (← links)
- Sampling from Arbitrary Centered Discrete Gaussians for Lattice-Based Cryptography (Q5086199) (← links)
- Towards a Simpler Lattice Gadget Toolkit (Q5087269) (← links)
