Solving SVP and CVP in 2^n time with Discrete Gaussian Sampling

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=vxXmAXyzOak


Duration: 36:30
568 views
7

Daniel Dadush, CWI, Amsterdam
The Mathematics of Modern Cryptography
http://simons.berkeley.edu/talks/noah-stephens-davidowitz-daniel-dadush-2015-07-07



Other Videos By Simons Institute for the Theory of Computing


2015-07-15Cryptography from Ideal Lattices
2015-07-15Output-Compressing Randomized Encodings and Applications
2015-07-15Cryptography via Burnside Groups
2015-07-15Multilinear Maps Over the Integers: From Design to Security
2015-07-15Attribute-based Encryption for Circuits
2015-07-15Fully Homomorphic Encryption
2015-07-15How Diffie-Hellman Fails in Practice
2015-07-15Finding Short Generators of Principal Ideals
2015-07-15Algebraic Algorithms for LWE
2015-07-15Attacks on Ring-LWE
2015-07-15Solving SVP and CVP in 2^n time with Discrete Gaussian Sampling
2015-07-14Pairings in Cryptography
2015-07-06The Oracle's Secrets
2015-06-23Quantum and Post-Quantum Cryptography
2015-06-15Cryptographic Agents: Towards a Unified Theory of Computing on Encrypted Data
2015-06-15Provably Secure Virus Detection: Using the Uncertainty to End Computer Malware
2015-06-15Oblivious RAM for MPC
2015-06-15On the Cryptographic Hardness of Finding a Nash Equilibrium
2015-06-15How Fair is your Protocol? A Utility-Based Approach to Protocol Optimality
2015-06-15New Advances in Secure RAM Computation
2015-06-15Efficient Multiparty Protocols via Log-Depth Threshold Formulae


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Cryptography
Daniel Dadush