Cryptography 101

Cryptography Fundamentals

Groups, modular arithmetic, RSA, and elliptic curves come together to build encryption and digital signatures. We also take a first look at hashing and core cryptographic protocols.

1. 01Cryptography 101: Where to Start
2. 02Cryptography 101 Asides: RSA Explained
3. 03Cryptography 101: Elliptic Curves (Somewhat) Demystified
4. 04Cryptography 101: Encryption and Digital Signatures
5. 05Cryptography 101: Hashing
6. 06Cryptography 101: Protocols Galore

Signatures, Sharing & Security

Blind, ring, multi-, and threshold signatures, built on top of polynomial secret sharing and homomorphisms, plus a primer on evaluating cryptographic security.

1. 07Cryptography 101: Signatures Recharged
2. 08Cryptography 101 Aside: Evaluating Security
3. 09Cryptography 101: Homomorphisms and Isomorphisms
4. 10Cryptography 101: Polynomials
5. 11Cryptography 101: Threshold Signatures

Zero Knowledge Basics

Pairings and polynomial commitments build up the arithmetic-circuit model behind zero-knowledge proofs, SNARKs, and STARKs.

1. 12Cryptography 101: Pairings
2. 13Cryptography 101: Pairing Applications & More
3. 14Cryptography 101: Commitment Schemes Revisited
4. 15Cryptography 101: Zero Knowledge Proofs (Part 1)
5. 16Cryptography 101: Arithmetic Circuits
6. 17Cryptography 101: Zero Knowledge Proofs (Part 2)
7. 18Cryptography 101: Zero Knowledge Proofs (Part 3)
8. 19Cryptography 101: STARKs

Lattice-based Cryptography Basics

Rings and lattices lead to the Ring-LWE problem, powering post-quantum schemes like Kyber and Dilithium, and fully homomorphic encryption.

1. 20Cryptography 101: Rings
2. 21Cryptography 101: Ring Learning With Errors
3. 22Cryptography 101: Post Quantum Cryptography
4. 23Cryptography 101: Fully Homomorphic Encryption