On Practical Discrete Gaussian Samplers for Lattice-Based Cryptography

DOI10.1109/TC.2016.2642962MaRDI QIDQ4567305zbMATH OpenOpenAlexFDO

Authors James Howe, Ayesha Khalid, Ciara Rafferty, Francesco Regazzoni, Máire O'Neill

Publication date 27 June 2018

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/tc.2016.2642962

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Combinatorial codes (94B25)

Cited in

(6)

• On the rejection rate of exact sampling algorithm for discrete Gaussian distributions over the integers
• A constant-time sampling algorithm for binary Gaussian distribution over the integers
• Efficiently masking binomial sampling at arbitrary orders for lattice-based crypto
• Polar sampler: a novel Bernoulli sampler using polar codes with application to integer Gaussian sampling
• Gaussian Sampling in Lattice Based Cryptography
• Practical Applications of Improved Gaussian Sampling for Trapdoor Lattices

This page was built for publication: On Practical Discrete Gaussian Samplers for Lattice-Based Cryptography

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4567305)