2026-09-20T13:58:26Zhttps://digital.lib.washington.edu/server/oai/request

oai:digital.lib.washington.edu:1773/350932026-02-16T02:09:45Zcom_1773_4888com_1773_25558com_1773_16364com_1773_16363col_1773_38512col_1773_25560

Katti, Raj More, Shruti Santosh 2016-03-11T22:35:53Z 2016-03-11T22:35:53Z 2016-03-11 2015 More_washington_0250O_15221.pdf http://hdl.handle.net/1773/35093 Thesis (Master's)--University of Washington, 2015 Sampling from the discrete Gaussian probability distribution is used in lattice-based cryptosystems. A need for faster and memory-efficient samplers has become a necessity for improving the performance of such cryptosystems. We propose a new algorithm for sampling from the Gaussian distribution that can efficiently change on-the-fly its speed/memory requirement. The Ziggurat algorithm that attempted to do this requires up to 1000 seconds of computation time to change memory requirements on-the-fly. Our algorithm eliminates this large computational overhead. application/pdf en_US Discrete Gaussian Sampling; Lattice-based cryptography; Ziggurat algorithm Computer science Computer science and systems Discrete Gaussian Sampling for Low-Power Devices Thesis Open Access open.access