Katti, RajMore, Shruti Santosh2016-03-112016-03-112016-03-112015More_washington_0250O_15221.pdfhttp://hdl.handle.net/1773/35093Thesis (Master's)--University of Washington, 2015Sampling 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/pdfen-USDiscrete Gaussian Sampling; Lattice-based cryptography; Ziggurat algorithmComputer scienceComputer science and systemsThesis