Finding Short Generators of Principal Ideals

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


Duration: 35:46
728 views
1

Chris Peikert, Georgia Institute of Technology
The Mathematics of Modern Cryptography
http://simons.berkeley.edu/talks/chris-peikert-2015-07-09



Other Videos By Simons Institute for the Theory of Computing


2015-07-15Graph-Induced Multilinear Maps from Lattices
2015-07-15Lattices with Symmetry
2015-07-15Noisy Connections: A Survey of Interactive Coding and Its Borders with Other Topics
2015-07-15Non-Malleable Codes in the Split-State Model
2015-07-15Homomorphic Commitments & Signatures
2015-07-15Attribute-based and Predicate Encryption
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-15Finding Short Generators of Principal Ideals
2015-07-15Historical Talk on Lattice-Based Cryptography
2015-07-15Solving SVP and CVP in 2^n time with Discrete Gaussian Sampling
2015-07-15Time-Lock Puzzles from Randomized Encodings
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


Tags:
Simons Institute
UC Berkeley
computer science
theory of computing
Cryptography
Chris Peikert