PricingLoginStart free
Cryptology Academy · Lesson

Modular Arithmetic Basics

Understand clock arithmetic and why it is central to cryptography.

Lesson 2 of 413 steps

Modular Arithmetic Basics is a free Cryptology Academy lesson on CoddyKit. This is lesson 2 of 4. You can read the complete lesson below for free — then practise it hands-on in the browser with a built-in code editor and a 24/7 AI tutor. It is part of the Cryptology Academy learning path, and your progress syncs across the web and the CoddyKit app. The Cryptology Academy course includes 4 lessons in total.

Welcome

Modular arithmetic — sometimes called 'clock arithmetic' — is the mathematical foundation of AES, RSA, Diffie-Hellman, and nearly every modern cipher.

What Is Modulo?

a mod m is the remainder when a is divided by m. 17 mod 5 = 2 (because 17 = 3×5 + 2). In Python: 17 % 5 == 2.

Clock Arithmetic Intuition

On a 12-hour clock, 10 + 5 = 3 (not 15). This is arithmetic mod 12. Modular arithmetic 'wraps around' at the modulus — exactly what we need for cipher math.

Modular Addition & Subtraction

(a + b) mod m = ((a mod m) + (b mod m)) mod m Example: (19 + 23) mod 7 = (5 + 2) mod 7 = 7 mod 7 = 0

Modular Multiplication

(a × b) mod m = ((a mod m) × (b mod m)) mod m Example: (13 × 17) mod 11 = (2 × 6) mod 11 = 12 mod 11 = 1

Modular Exponentiation

RSA uses a^b mod m. For large exponents we use square-and-multiply: 2^10 mod 13: 2^2=4, 4^2=16≡3, 3^2=9, 9×2^2=9×4=36≡10. Python: pow(2, 10, 13) → 10

Modular Inverse

a^(-1) mod m is the value x such that a×x ≡ 1 (mod m). Example: 3^(-1) mod 7 = 5 because 3×5=15≡1 (mod 7). Used in RSA and Affine cipher decryption.

Extended Euclidean Algorithm

The Extended Euclidean Algorithm efficiently computes modular inverses. Python: pow(3, -1, 7) == 5 (Python 3.8+ supports negative exponents in pow).

Fermat's Little Theorem

If p is prime: a^p ≡ a (mod p), so a^(p-1) ≡ 1 (mod p). This means a^(-1) ≡ a^(p-2) (mod p). Used in RSA key generation and primality tests.

Chinese Remainder Theorem (CRT)

CRT allows solving simultaneous modular equations. RSA decryption uses CRT to speed up computation by working modulo p and q separately, then combining results.

Modular Arithmetic in AES

AES operates in GF(2^8) — a Galois field where addition is XOR and multiplication uses polynomial arithmetic mod an irreducible polynomial. All AES arithmetic is modular.

Quick Check

What is pow(2, 10, 7) in Python?
Answer it in the interactive lesson

Recap

Modular arithmetic mastered! Next we study prime numbers — why they are special and why factoring them underpins RSA security.
Free to start

Learn Cryptology Academy with an AI tutor — free

Write and run real code in your browser, get instant help from a 24/7 AI tutor, and pick up where you left off on the web or in the app.

Courses
67
Lessons
261
Start learning freeView the full course

Frequently Asked Questions

Is the “Modular Arithmetic Basics” lesson free?

Yes — the full text of “Modular Arithmetic Basics” is free to read here on the web. To practise it interactively (a built-in code editor and a 24/7 AI tutor) and unlock the rest of the Cryptology Academy course, upgrade to CoddyKit PRO. The Cryptology Academy course includes 4 lessons in total.

What will I learn in “Modular Arithmetic Basics”?

Understand clock arithmetic and why it is central to cryptography. You practise Cryptology Academy with hands-on code you run directly in the browser, and a 24/7 AI tutor answers your questions as you work through the lesson.

Do I need any experience to start Cryptology Academy?

No prior experience is required. Cryptology Academy on CoddyKit is structured for beginners through advanced learners, so you can start here or from the beginning and move at your own pace. This is lesson 2 of 4.

How long does the “Modular Arithmetic Basics” lesson take?

Most CoddyKit lessons take about 5–10 minutes. Each one is bite-sized and interactive, so you make steady progress and pick up exactly where you left off across the web and the app.

Can I write and run code in this Cryptology Academy lesson?

Yes. Every Cryptology Academy lesson includes a built-in code editor, so you write and run real code right in your browser and get instant AI feedback — no local setup required.

All lessons in this course

  1. Binary & Hexadecimal Fundamentals
  2. Modular Arithmetic Basics
  3. Prime Numbers & Factorization
  4. GCD, Euler's Totient & Number Theory Intro
← Back to Cryptology Academy