Sharper bounds in lattice-based cryptography using the Rényi divergence
From MaRDI portal
Publication:2412879
DOI10.1007/978-3-319-70694-8_13zbMath1420.94092OpenAlexW2724706083MaRDI QIDQ2412879
Publication date: 6 April 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-70694-8_13
Related Items (12)
A constant-time sampling algorithm for binary Gaussian distribution over the integers ⋮ Isochronous Gaussian Sampling: From Inception to Implementation ⋮ COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers ⋮ Gadget-based iNTRU lattice trapdoors ⋮ On the bit security of cryptographic primitives ⋮ On rejection sampling in Lyubashevsky's signature scheme ⋮ Bit security as computational cost for winning games with high probability ⋮ Compact lattice gadget and its applications to hash-and-sign signatures ⋮ Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling ⋮ Exact lattice sampling from non-Gaussian distributions ⋮ On the rejection rate of exact sampling algorithm for discrete Gaussian distributions over the integers ⋮ Integral matrix Gram root and lattice Gaussian sampling without floats
This page was built for publication: Sharper bounds in lattice-based cryptography using the Rényi divergence
