Pages that link to "Item:Q1680223"
From MaRDI portal
The following pages link to Gaussian sampling over the integers: efficient, generic, constant-time (Q1680223):
Displaying 32 items.
- Sampling from discrete Gaussians for lattice-based cryptography on a constrained device (Q742507) (← links)
- Gaussian sampling of lattices for cryptographic applications (Q893724) (← links)
- On the bit security of cryptographic primitives (Q1648779) (← links)
- Faster Gaussian sampling for trapdoor lattices with arbitrary modulus (Q1648788) (← links)
- Rounded Gaussians -- fast and secure constant-time sampling for lattice-based crypto (Q1753876) (← links)
- Arbitrary-centered discrete Gaussian sampling over the integers (Q2030879) (← links)
- Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices (Q2055645) (← links)
- On the rejection rate of exact sampling algorithm for discrete Gaussian distributions over the integers (Q2095466) (← links)
- Rounding in the rings (Q2096527) (← links)
- An optimized GHV-type HE scheme: simpler, faster, and more versatile (Q2096603) (← links)
- Implementation of lattice trapdoors on modules and applications (Q2118540) (← links)
- A practical adaptive key recovery attack on the LGM (GSW-like) cryptosystem (Q2118564) (← 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)
- An improved exact sampling algorithm for the standard normal distribution (Q2135885) (← links)
- Gadget-based iNTRU lattice trapdoors (Q2152053) (← links)
- \textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon} (Q2170090) (← links)
- Discrete Gaussian measures and new bounds of the smoothing parameter for lattices (Q2666966) (← links)
- Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling (Q2701491) (← links)
- A Constant Factor Approximation Algorithm for Event-Based Sampling (Q4931146) (← links)
- PAKEs: New Framework, New Techniques and More Efficient Lattice-Based Constructions in the Standard Model (Q5041165) (← 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)
- Towards a Simpler Lattice Gadget Toolkit (Q5087269) (← links)
- Securing approximate homomorphic encryption using differential privacy (Q6155269) (← links)
- Bit security as computational cost for winning games with high probability (Q6157548) (← links)
- How to sample a discrete Gaussian (and more) from a random oracle (Q6169425) (← links)
- Spherical Gaussian leftover hash lemma via the Rényi divergence (Q6535100) (← links)
- Ring signatures for deniable AKEM: Gandalf's fellowship (Q6648196) (← links)
- Concretely efficient lattice-based polynomial commitment from standard assumptions (Q6660308) (← links)
