Completed
The Bounded Distance Decoding (BDD) problem
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Security and Encoding in Fully Homomorphic Encryption - Rachel Player, Sorbonne Université
Automatically move to the next video in the Classroom when playback concludes
- 1 Intro
- 2 What is homomorphic encryption?
- 3 Achieving homomorphic encryption
- 4 Applications of homomorphic encryption
- 5 Is homomorphic encryption practical?
- 6 The Learning with Errors problem (LWE)
- 7 LWE parameters
- 8 The Bounded Distance Decoding (BDD) problem
- 9 The Ring-LWE problem
- 10 Security argument for the FV scheme?
- 11 Algorithms for solving LWE
- 12 NIST post-quantum standardisation process
- 13 Estimating NTRU-based schemes in the LWE estimator
- 14 Estimating cost of Lattice reduction
- 15 Implementing the SVP oracle
- 16 Translating asymptotics into concrete cost
- 17 Cost models used in NIST proposal
- 18 Need to ensure correctness of decoding
- 19 Examples: binary and balanced base-B encoding
- 20 Other choices for comparison
- 21 Maximal depth and noise
