Rounded Gaussians -- fast and secure constant-time sampling for lattice-based crypto
From MaRDI portal
Publication:1753876
DOI10.1007/978-3-319-76581-5_25zbMath1420.94073OpenAlexW2794763551MaRDI QIDQ1753876
Tanja Lange, Kit Smeets, Andreas Hülsing
Publication date: 29 May 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-76581-5_25
signatureslattice-based cryptographypost-quantum cryptographyGaussian samplingBLISSconstant-time implementations
Related Items (4)
Isochronous Gaussian Sampling: From Inception to Implementation ⋮ COSAC: COmpact and Scalable Arbitrary-Centered Discrete Gaussian Sampling over Integers ⋮ Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling ⋮ Key recovery from Gram-Schmidt norm leakage in hash-and-sign signatures over NTRU lattices
This page was built for publication: Rounded Gaussians -- fast and secure constant-time sampling for lattice-based crypto