Sampling from discrete Gaussians for lattice-based cryptography on a constrained device

81Citations
Citations of this article
50Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Modern lattice-based public-key cryptosystems require sampling from discrete Gaussian (normal) distributions. The paper surveys algorithms to implement such sampling efficiently, with particular focus on the case of constrained devices with small on-board storage and without access to large numbers of external random bits. We review lattice encryption schemes and signature schemes and their requirements for sampling from discrete Gaussians. Finally, we make some remarks on challenges and potential solutions for practical lattice-based cryptography. © 2014 Springer-Verlag Berlin Heidelberg.

Cite

CITATION STYLE

APA

Dwarakanath, N. C., & Galbraith, S. D. (2014). Sampling from discrete Gaussians for lattice-based cryptography on a constrained device. Applicable Algebra in Engineering, Communications and Computing, 25(3), 159–180. https://doi.org/10.1007/s00200-014-0218-3

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free