GCD, Euler's Totient & Number Theory Intro
Apply GCD and Euler's totient function to real crypto problems.
Welcome
The GCD and Euler's totient function are essential tools in RSA and many other public-key systems. Let's master them with examples.
Greatest Common Divisor (GCD)
GCD(a, b) is the largest integer that divides both a and b without remainder. GCD(12, 8) = 4. If GCD(a, m) = 1, we say a and m are coprime or relatively prime.
All lessons in this course
- Binary & Hexadecimal Fundamentals
- Modular Arithmetic Basics
- Prime Numbers & Factorization
- GCD, Euler's Totient & Number Theory Intro