Modular Inverse with the Extended Euclidean Algorithm
This lesson is part of the course
In this lesson
You find the inverse of 17 modulo 3,120 with an extended-Euclid step table: quotients, remainders and the coefficient t that becomes the private key d.
Buy the course once for $9.99 to unlock every lesson and lab, the final exam and the certificate – lifetime access, no subscription.
Lessons in this course
- MOD & Clock Arithmetic: Remainders That Wrap Around Locked
- Caesar & Affine Ciphers: Letters as Numbers Locked
- Frequency Analysis: Breaking a Caesar Cipher with COUNTIF Locked
- GCD & Euclid's Algorithm: A Step Table Locked
- Modular Inverse with the Extended Euclidean Algorithm Locked
- Fast Modular Exponentiation: Square-and-Multiply Locked
- Toy RSA: Keys, Encryption & Decryption Locked
- Check Digits & Hashing Ideas: ISBN-13 and Luhn Locked