University of Birmingham > Talks@bham > Computer Science Distinguished Seminars > Discrete Gaussian Sampling over the Integers Using Polar Codes

Discrete Gaussian Sampling over the Integers Using Polar Codes

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Ceinwen Cushway.

This talk has been canceled/deleted

Gaussian sampling over the integers is one of the fundamental building blocks of latticed-based cryptography. We propose a new integer Gaussian sampler based on polar codes, dubbed “polar sampler”. The polar sampler is asymptotically information theoretically optimum. It also features quasi-linear complexity and constant-time implementation. Security analysis is given based on the statistical distance, Kullback-Leibler divergence and Rényi divergence.

This talk is part of the Computer Science Distinguished Seminars series.

Tell a friend about this talk:

This talk is included in these lists:

This talk is not included in any other list

Note that ex-directory lists are not shown.


Talks@bham, University of Birmingham. Contact Us | Help and Documentation | Privacy and Publicity.
talks@bham is based on from the University of Cambridge.