55 lines
1.7 KiB
Markdown
55 lines
1.7 KiB
Markdown
# Math Foundation for Cryptography
|
|
|
|
Study system combining:
|
|
- **MIT 6.1200J** — Mathematics for Computer Science (Spring 2024)
|
|
- **University at Buffalo CSE 191** — Discrete Structures
|
|
- **University of Toronto CSC110/111** — Computational Thinking
|
|
|
|
## Folder Structure
|
|
|
|
- **discrete-math/** — Sets, logic, proofs, induction
|
|
- **linear-algebra/** — Vectors, matrices, operations
|
|
- **number-theory/** — Modular arithmetic, primes, GCD, etc.
|
|
- **logic-proofs/** — Formal reasoning, proof techniques
|
|
- **graph-theory/** — Graphs, trees, algorithms
|
|
- **algorithms/** — Complexity, sorting, searching
|
|
- **cryptography-prep/** — Building blocks for crypto (once foundation is solid)
|
|
- **lectures/** — Course-specific lecture notes (see below)
|
|
- **lecture-notes/** — Raw notes from lectures before organizing
|
|
|
|
## Lectures
|
|
|
|
- [Ethereum Cryptography 2026](./lectures/ethereum-crypto-2026/) — EPF course
|
|
|
|
## Study Flow
|
|
|
|
1. Watch lecture → save raw notes to `lecture-notes/`
|
|
2. Extract key concepts → organize into appropriate topic folder
|
|
3. Link cross-references between topics
|
|
4. System reminds you of old concepts periodically
|
|
5. Practice problems generated from your notes
|
|
|
|
## Topics Covered
|
|
|
|
### Foundational (Start Here)
|
|
- [ ] Sets and Logic
|
|
- [ ] Proof Techniques
|
|
- [ ] Induction
|
|
- [ ] Basic Algorithms
|
|
|
|
### Intermediate
|
|
- [ ] Discrete Math (combinatorics, graphs)
|
|
- [ ] Linear Algebra (matrices, vectors)
|
|
- [ ] Modular Arithmetic
|
|
- [ ] Number Theory Basics
|
|
|
|
### Advanced (Path to Crypto)
|
|
- [ ] Prime Numbers and Factorization
|
|
- [ ] GCD and Extended Euclidean Algorithm
|
|
- [ ] Fermat's Little Theorem
|
|
- [ ] Chinese Remainder Theorem
|
|
- [ ] Cryptography Foundations
|
|
|
|
## Last Updated
|
|
Created: March 12, 2026
|