Faster Algorithms for Approximate Common Divisors

Faster Algorithms for Approximate Common Divisors

TheIACR via YouTube Direct link

Motivation: Security of FHE schemes

2 of 16

2 of 16

Motivation: Security of FHE schemes

Class Central Classrooms beta

YouTube videos curated by Class Central.

Classroom Contents

Faster Algorithms for Approximate Common Divisors

Automatically move to the next video in the Classroom when playback concludes

  1. 1 Intro
  2. 2 Motivation: Security of FHE schemes
  3. 3 FHE based on Approx-GCD
  4. 4 Our work
  5. 5 Approximate Common-Divisor Problem
  6. 6 Our Algorithm
  7. 7 Classical Tools
  8. 8 Tool (1): Product Tree
  9. 9 Tool (2): Evaluation
  10. 10 Result
  11. 11 Noisy Factoring Problem: Key Recovery Attack
  12. 12 Noisy Factoring On Unknown Positions: Key Recovery Attack
  13. 13 RSA-CRT With Noisy Message: Key Recovery Attack
  14. 14 Low-Exponent RSA problem: Message Recovery Attack
  15. 15 Conclusion
  16. 16 Analysis of FHE Schemes

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.