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.
Sharper Bounds in Lattice-Based Cryptography Using the Rényi Divergence
Overview
Syllabus
Sharper Bounds in Lattice-Based Cryptography Using the Rényi Divergence
Taught by
TheIACR
Related Courses
-
Lattice-Based Cryptography
-
Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions
-
Lattice Cryptography
-
Lower Bounds on Lattice Enumeration with Extreme Pruning
-
Lattice-Based Public Key Cryptography - Session 2
-
Lattice-Based Cryptography: Principles and Applications in Post-Quantum Standards
