📜

🔑

🗝️

🔑

📜

🔑

📜

🔒

🔐

🔑

📜

🔐

The Secret Realm

Cryptography

Master the art of secure communication through ciphers, encryption, and cryptographic protocols.

🚀 Start Learning

📚

Topics

🔐

15+

Interactive Demos

🎯

50+

Practice Problems

🎯Choose Your Topic

1️⃣

Divisibility & Primes

Foundation of all cryptography: prime numbers and divisibility rules

Explore→

2️⃣

GCD & Euclidean Algorithm

Finding greatest common divisors efficiently - key for computing inverses

Explore→

🔢

Modular Arithmetic

Clock arithmetic - the foundation of all cryptographic operations

Explore→

3️⃣

Modular Inverses

Finding multiplicative inverses in modular arithmetic

Explore→

4️⃣

Fermat's Little Theorem

A powerful tool for computing large powers modulo primes

Explore→

5️⃣

Euler's Totient & Theorem

Counting coprime numbers - crucial for RSA

Explore→

6️⃣

Prime Number Theory

Distribution of primes - security of large prime generation

Explore→

7️⃣

Discrete Logarithm Problem

The hard problem behind Diffie-Hellman and ElGamal

Explore→

Groups

Algebraic structures fundamental to cryptography

Explore→

→

Homomorphisms

Structure-preserving maps - key for homomorphic encryption

Explore→

Quotient Structures

Quotient groups and rings - foundation for finite field arithmetic

Explore→

Rings

Two operations - the algebra behind polynomial arithmetic

Explore→

Fields

Complete algebraic structure - foundation for finite fields

Explore→

𝔾

Galois Theory Introduction

Field extensions and automorphisms - advanced ECC

Explore→

∩

Sets

Set theory fundamentals

Explore→

🔀

Propositional Logic

Boolean logic - foundation of all security proofs

Explore→

↔️

Relations

Binary relations and equivalence

Explore→

Functions in Discrete Math

Bijections and permutations - encryption fundamentals

Explore→

🎰

Combinatorics

Counting - security parameter analysis

Explore→

🕸️

Graph Theory

Graph structures in cryptographic protocols

Explore→

🎲

What is Probability?

Random events and probability spaces

Explore→

Conditional Probability

Probability given information - key for security analysis

Explore→

🔄

Bayes' Theorem

Updating beliefs with evidence

Explore→

Random Variables

Numerical outcomes of random experiments

Explore→

📊

Common Distributions

Uniform, geometric, and other key distributions

Explore→

📐

Vectors & Notation

Vector spaces over finite fields

Explore→

▦

Matrices

Matrix operations in cryptography

Explore→

📡

Information Theory

Entropy, perfect secrecy, and Shannon - the theory of information

Explore→

➡️

One-Way Functions

Functions easy to compute, hard to invert - the heart of crypto

Explore→

🎰

Randomness & PRNGs

Cryptographically secure random number generation

Explore→

🔤

Classical Ciphers

The foundation of cryptography: substitution and transposition techniques

Explore→

🔑

Symmetric Encryption

Modern block and stream ciphers using shared secret keys

Explore→

🔓

Asymmetric Encryption

Public-key cryptography: different keys for encryption and decryption

Explore→

🧬

Hash Functions

One-way functions for integrity verification and fingerprinting

Explore→

🤝

Protocols

Combining primitives into secure communication systems

Explore→

🌀

Elliptic Curve Cryptography

Elliptic curves over finite fields - compact keys, strong security

Explore→

✍️

Digital Signatures

Cryptographic proof of authenticity and non-repudiation

Explore→

🔀

Key Exchange

Securely establishing shared secrets over public channels

Explore→

🎭

Zero-Knowledge Proofs

Proving knowledge without revealing information

Explore→

🛡️

Authenticated Encryption

Confidentiality and integrity in one operation

Explore→

✨What You'll Learn

🔤

Classical Ciphers

Learn the historical foundations of secret communication

🔑

Symmetric Encryption

Master modern block and stream ciphers

🔓

Public Key Crypto

Understand RSA, Diffie-Hellman, and elliptic curves

🧬

Hash Functions

Explore cryptographic hashing and integrity