12:373 Modular Arithmetic for Cryptography- Part 2: GCD, Bézout’s Identity, Extended Euclidean AlgorithmDr Nitin Naik - Aston University, UK23.4K viewsView & Download
19:48Abstract Algebra | Writing a polynomial gcd as a combination -- example.Michael Penn34.1K viewsView & Download
22:21GCD, Bezout, and Modular Inverses | The Extended Euclidean AlgorithmWilliam Y. Feng11.2K viewsView & Download
6:00Extended Euclidean Algorithm and Inverse Modulo TutorialBest Friends Farm971.1K viewsView & Download