3 Modular Arithmetic for Cryptography- Part 2: GCD, Bézout’s Identity, Extended Euclidean Algorithm

preview_player
Показать описание
Greatest Common Divisor (GCD)/Highest Common Factor (HCF)
Euclidean/Euclid’s Algorithm for GCD/HCF
Bézout's Lemma/ Bézout’s Identity
Extended Euclidean Algorithm for GCD and Bézout’s Coefficients
Рекомендации по теме