Magic Internet Math
Learn the mathematics that powers cryptography, from simple clock arithmetic to the algorithms protecting the internet.
Start LearningCourse Outline
Module 1: Foundations
-
1
Introduction
Why math matters for cryptography
-
2
Modular Arithmetic
Clock math and the mod operation
-
3
Prime Numbers
The building blocks of number theory
Module 2: Number Theory
-
4
GCD & Euclidean Algorithm
Finding common divisors efficiently
-
5
Modular Inverse
Division in modular arithmetic
-
6
Euler's Totient Function
Counting coprime numbers
Module 3: Applied Number Theory
-
7
Modular Exponentiation
Computing large powers efficiently
-
8
Discrete Logarithms
One-way functions and hard problems
Module 4: Cryptographic Protocols
-
9
RSA Encryption
The most famous public-key algorithm
-
10
Diffie-Hellman Key Exchange
Sharing secrets over public channels
-
11
Elliptic Curves
Modern cryptography with curves
Assessment
No prerequisites required! We start from the very basics and build up. All you need is curiosity and basic arithmetic.