Lecture 11: Number Theory for PKC: Euclidean Algorithm, Euler's Phi Function & Euler's Theorem
Introduction to Cryptography by Christof Paar · 91:01
The lecture moves from symmetric to public-key (asymmetric) cryptography and spends the whole 90 minutes on the number theory it depends on. The central result is that the extended Euclidean algorithm computes modular...