Sharper Bounds in Lattice-Based Cryptography Using the Rényi Divergence

Sharper Bounds in Lattice-Based Cryptography Using the Rényi Divergence

Explore a research presentation on improving bounds in lattice-based cryptography through the application of Rényi divergence. Delve into the findings of Thomas Prest's paper, presented at Asiacrypt 2017, which offers novel approaches to enhancing the security and efficiency of lattice-based cryptographic systems. Gain insights into advanced mathematical techniques used to refine security estimates and potentially optimize cryptographic schemes based on lattice problems.