Gaussian sampling over the integers: efficient, generic, constant-time

From MaRDI portal
Publication:1680223

DOI10.1007/978-3-319-63715-0_16zbMath1410.94098OpenAlexW2613335035MaRDI QIDQ1680223

Daniele Micciancio, Michael Walter

Publication date: 15 November 2017

Full work available at URL: https://doi.org/10.1007/978-3-319-63715-0_16




Related Items (23)

A constant-time sampling algorithm for binary Gaussian distribution over the integersPAKEs: New Framework, New Techniques and More Efficient Lattice-Based Constructions in the Standard ModelImproved Discrete Gaussian and Subgaussian Analysis for Lattice CryptographyIsochronous Gaussian Sampling: From Inception to ImplementationCOSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over IntegersAn improved exact sampling algorithm for the standard normal distributionGadget-based iNTRU lattice trapdoorsOn the bit security of cryptographic primitivesFaster Gaussian sampling for trapdoor lattices with arbitrary modulus\textsc{Mitaka}: a simpler, parallelizable, maskable variant of \textsc{Falcon}Towards a Simpler Lattice Gadget ToolkitDiscrete Gaussian measures and new bounds of the smoothing parameter for latticesSecuring approximate homomorphic encryption using differential privacyBit security as computational cost for winning games with high probabilityHow to sample a discrete Gaussian (and more) from a random oraclePolar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian samplingKey recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU latticesOn the rejection rate of exact sampling algorithm for discrete Gaussian distributions over the integersRounding in the ringsAn optimized GHV-type HE scheme: simpler, faster, and more versatileImplementation of lattice trapdoors on modules and applicationsA practical adaptive key recovery attack on the LGM (GSW-like) cryptosystemIntegral matrix Gram root and lattice Gaussian sampling without floats




This page was built for publication: Gaussian sampling over the integers: efficient, generic, constant-time