![]() |
![]() |
University of Birmingham > Talks@bham > Computer Security Seminars > Discrete Gaussian Sampling over the Integers Using Polar Codes
Discrete Gaussian Sampling over the Integers Using Polar CodesAdd to your list(s) Download to your calendar using vCal
If you have a question about this talk, please contact Andreea Radu. 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 Security Seminars series. This talk is included in these lists:
Note that ex-directory lists are not shown. |
Other listsFilling in the blank – I will be ….... in 2050’ Biosciences seminars Computer Science Distinguished SeminarOther talksUltrafast Spectroscopy and Microscopy as probes of Energy Materials TBC TBA TBA TBA Life : it’s out there, but what and why ? |