Show simple item record

dc.contributor.advisorKatti, Raj
dc.contributor.authorMore, Shruti Santosh
dc.date.accessioned2016-03-11T22:35:53Z
dc.date.available2016-03-11T22:35:53Z
dc.date.submitted2015
dc.identifier.otherMore_washington_0250O_15221.pdf
dc.identifier.urihttp://hdl.handle.net/1773/35093
dc.descriptionThesis (Master's)--University of Washington, 2015
dc.description.abstractSampling 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.
dc.format.mimetypeapplication/pdf
dc.language.isoen_US
dc.subjectDiscrete Gaussian Sampling; Lattice-based cryptography; Ziggurat algorithm
dc.subject.otherComputer science
dc.subject.othercomputing and software systems
dc.titleDiscrete Gaussian Sampling for Low-Power Devices
dc.typeThesis
dc.embargo.termsOpen Access


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record