Discrete Gaussian Sampling over the Integers Using Polar Codes

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

• Dr Cong Ling, Imperial College London
• Thursday 13 February 2020, 14:00-15:00
• Computer Science, The Sloman Lounge (UG).

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:

• Computer Science Departmental Series
• Computer Science Distinguished Seminars
• Computer Science, The Sloman Lounge (UG)
• Computer Security Seminars
• computer sience

Note that ex-directory lists are not shown.