Notes
Markdown files in src/content/notes/ publish here automatically.
- Algorithms — 20 notes
- Data & Databases — 0 notes
- Finance — 1 note
- Hardware — 9 notes
- Machine Learning & AI — 12 notes
- Mathematics — 117 notes
- Research Papers — 1 note
- Security and Privacy — 70 notes
- Software Engineering — 0 notes
- Systems & Networks — 59 notes
- Theoretical Computer Science — 19 notes
- Abstract Algebra — 0 notes
- Agentic AI — 1 note
- Algorithms — 2 notes
- Application Security — 0 notes
- Automata & Formal Languages — 0 notes
- Bandits — 20 notes
- Calculus & Analysis — 6 notes
- Classical Machine Learning — 0 notes
- Compilers — 0 notes
- Computability — 0 notes
- Computation — 1 note
- Computational Complexity — 0 notes
- Computational Complexity — 16 notes
- Computer Architecture — 0 notes
- Computer Vision — 0 notes
- Concurrency — 0 notes
- Cryptography — 33 notes
- Data Analysis — 0 notes
- Data Engineering — 0 notes
- Data Structures & Storage — 0 notes
- Databases — 0 notes
- Decentralized Systems — 12 notes
- Deep Learning — 0 notes
- DevOps & Tooling — 0 notes
- Differential Privacy — 8 notes
- Digital Logic — 0 notes
- Discrete Mathematics — 0 notes
- Distributed Systems — 25 notes
- Dynamical Systems — 18 notes
- Embedded Systems — 0 notes
- Emerging Technologies — 3 notes
- FPGAs — 0 notes
- Game Theory — 25 notes
- Generative Models — 11 notes
- Graph Theory — 0 notes
- Hardware Security — 1 note
- Information Retrieval — 0 notes
- Information Theory — 27 notes
- Iot — 9 notes
- Linear Algebra — 8 notes
- Logic & Proof — 0 notes
- Measure Theory — 1 note
- ML Systems — 0 notes
- Natural Language Processing — 0 notes
- Network Security — 2 notes
- Networking — 0 notes
- Operating Systems — 13 notes
- Optimization — 9 notes
- Performance & Scalability — 0 notes
- Portfolio Theory — 1 note
- Privacy — 2 notes
- Probability — 11 notes
- Probability & Statistics — 0 notes
- Programming Languages — 0 notes
- Quantum Cryptography — 11 notes
- Quantum Information — 13 notes
- Reinforcement Learning — 0 notes
- Security Engineering — 6 notes
- Signal Processing — 9 notes
- Software Architecture — 0 notes
- Systems Security — 3 notes
- Testing — 0 notes
- VLSI — 0 notes
- Web Security — 1 note
- A First Course in Probability
- Access Control and Authentication
- Additional Public-Key Tools
- Address Spaces and Space Management
- Advanced Topics in Classical Complexity Theory
- Adversarial Linear Bandits
- Algorithmic game theory
- API Security and Digital Rights Management
- Asynchronous Agreement Protocols
- Attacks on RSA and the Generic Group Model
- Authenticated Encryption
- Authenticated Key Exchange — Foundations
- Automata and Formal Languages
- Balanced Networks, Chaos, and Input-Driven Dynamics
- Bandit Algorithms
- Basic Solution Concepts and the Complexity of Nash Equilibria
- Basics of Quantum Information, Computation, and Cryptography
- Bayesian Bandits
- BCH and Reed-Solomon Codes
- Benign and PBFT-Style Partial Synchrony Protocols
- Bifurcations in One Dimension, and Flows on the Circle
- Big Data Processing Frameworks — Streaming and Graphs
- Block Cipher Attacks, PRF Constructions, and the Ideal Cipher Model
- Block Cipher Constructions and Pseudorandom Objects
- Blockchain and Cryptocurrency Security
- Blockchain Systems and Applications
- Boolean Fourier Analysis and Complexity Measures of Boolean Functions
- Bra-Ket Notation and a Quantum Linear Algebra Review
- Canonical Forms
- Cascading Behavior In Networks
- Channel Capacity
- Classical Cryptography and Perfect Secrecy
- Cloud Computing and MapReduce
- Cluster Scheduling and Distributed File Systems
- Combinatorial Auctions and Approximation Mechanisms
- Combinatorial Bandits
- Composite Quantum Systems and Entanglement
- Computational Aspects Of Prediction Markets
- Computational Evolutionary Game Theory
- Computing Market Equilibria
- Concentration Inequalities, the Law of Large Numbers, and the Central Limit Theorem
- Concentration of Measure for Bandits
- Concurrency and Threads
- Conditional Probability, Independence, and Bayes' Formula
- Confidence Bounds and Optimal Design for Least Squares Estimators
- Consensus Models and Adversaries
- Contextual Bandits
- Continuous-Type Random Variables and Their Distributions
- Controllability, Observability, and Canonical Forms
- Controlled Diffusion and Composition
- Convex Analysis for Bandits
- Core Network Protocols and Devices
- Correctness of Distributed Programs
- Correlation, Covariance, MMSE Estimation, and the Joint Gaussian Distribution
- Cost Sharing
- CPA-Secure Encryption — Modes of Operation
- CPU Scheduling
- Cramer-Shoup and Practical CCA-Secure Encryption
- Cryptography and Game Theory
- DAG-Based BFT Protocols
- Data Compression and Source Coding
- Deletion-Correcting Codes and Trace Reconstruction
- Descent Methods and Momentum
- Determinants and Multilinear Forms
- Device I/O, Interrupts, and Systems-on-Chip
- Diagonalization
- Differential Entropy
- Differential Privacy — Mechanisms, Composition, and Lower Bounds
- Differentially Private Statistical Estimation, Machine Learning, and Testing
- Differentiation, Adjoints, and Automatic Differentiation
- Diffusion Models
- Diffusion Models as Differential Equations — SDEs, ODEs, and an Introduction to Flows
- Digital Filter Design
- Digital Signatures and Public-Key Infrastructure
- Discrete Random Variables and Their Distributions
- Distributed Algorithmic Mechanism Design
- Distributed Consensus and Paxos
- Distributed Discrete-Event Simulation
- Distributed File Systems
- Distributed Mutual Exclusion
- Distributed Snapshots and Global State Collection
- Distributed Storage Codes
- Distributed Transactions and Concurrency Control
- Domain-Specific Security Case Studies
- Duality and Lagrangian Methods
- ECE 313 Course Notes
- Editing Diffusion Models — Low-Rank Structure and Surgery
- Eigenvalue Problems and Sturm–Liouville Theory
- Elements of Information Theory
- Elliptic Curve Cryptography
- Entanglement Measures and Distillation
- Enterprise IoT Networking
- Entropy Rates of a Stochastic Process
- Estimation and the Kalman Filter
- Event-Based Concurrency and Preemptive Multitasking
- Expander Codes, LDPC Codes, and Fountain Codes
- Expander Graphs — Fundamentals
- Explicit Constructions of ε-Biased Distributions and Error-Correcting Codes
- Explore-Then-Commit and the Upper Confidence Bound Algorithms
- Fault-Tolerant Systems — Fundamentals
- Feature Tour
- Finite Fields and Algebraic Preliminaries
- First-Order Differential Equations
- First-Order Methods for Constrained Optimization
- Flow Matching
- Forced Linear Systems and State-Space Realizations
- Foundations of Probability
- Foundations of Smooth Optimization
- Fourier Series
- Fourier Transforms and the DTFT
- Fractals and Strange Attractors
- Frequency Response and Ideal Filters
- Fully Homomorphic Encryption — Classical and Quantum
- Gambling and Data Compression
- Garbled Circuits and the Universal Composability Framework
- Generative Models — Overview
- Gossip, Membership, and Failure Detectors
- Graph Algorithms in Distributed Systems
- Graphical Games
- Group Communication and Multicast
- Group Testing
- Guidance, CLIP, and Text-to-Image Models
- Hardware Security and Side Channels
- Hash Function Constructions, Merkle Trees, and Key Derivation
- Hash-Based Signature Schemes
- Hierarchy Theorems, Relativization, and Circuit Complexity
- Hypercontractivity and Small-Set Expansion
- Identification Protocols, Password Security, and One-Time Passwords
- Impulse Response, Convolution, and Difference Equations
- Incentives And Information Security
- Incentives And Pricing In Communication Networks
- Incentives In Peer-To-Peer Systems
- Information Hiding — Watermarking and Steganography
- Information Theory and Portfolio Theory
- Information Theory and Statistics
- Information Theory Inequalities
- Information, Entropy, Relative Entropy, and Mutual Information
- Inner Product Spaces
- Interactive Proofs and the PCP Theorem
- Internet Fundamentals for IoT
- Interprocess Communication
- Introduction and Autonomous Linear Dynamical Systems
- Introduction to Distributed Systems
- Introduction to Mechanism Design
- Introduction to Nonlinear Dynamics, and Flows on the Line
- Introduction to Optimization for Data Analysis
- Inverse Problems and Posterior Sampling with Diffusion Models
- IoT Circuits and Electronics
- IoT Device Architectures and Programming
- Jointly Distributed Random Variables
- Key-Value Stores and NoSQL
- Kolmogorov Complexity
- Lattice Cryptography — SIS, Trapdoor Sampling, and Signatures
- Leader Election and Synchronizers
- Learning as a Dynamical System
- Learning, Regret Minimization, and Equilibria
- Limit Cycles and Bifurcations in Two Dimensions
- Linear Codes, Bounds on Code Size, and the MacWilliams Identities
- Linear Transformations and Matrices
- LLM and Agent Security
- LOCC, Quantum Teleportation, and Repeaters
- Locks and Synchronization
- Lower Bounds for Byzantine Agreement
- Lower Bounds for Finite-Armed Bandits
- Lower Bounds for Stochastic Linear Bandits
- MAC Constructions from PRFs
- Machine Learning Security and Data Privacy
- Malware and Malicious Software
- Managing and Assuring Secure Systems
- Manipulation-Resistant Reputation Systems
- Markov Decision Processes — From Bandits to Reinforcement Learning
- Mathematical Preliminaries for the Theory of Computation
- Maximum Entropy
- Measure Theory
- Mechanical Vibrations, Forced Oscillations, and Resonance
- Medium Access Control for IoT
- Memory Corruption and Control-Flow Hijacking
- Mesh Routing and Service Discovery
- Message Authentication Codes and Hash Functions
- Mobile and Automotive Security
- Models of Distributed Computation
- Molecular and DNA Storage Coding
- MPC via Arithmetic Circuits and Beaver's Protocol
- Multiagent Systems: Algorithmic, Game-Theoretic and Logical Foundations
- Multilevel and Multilateral Security
- Multirate Signal Processing
- Nakamoto Consensus and Blockchains
- NeRFs and Inverse Rendering
- Network Formation Games And The Potential Function Method
- Network Information Theory
- Network Security — Link and IP Layer
- Non-Interactive Zero-Knowledge and SNARKs
- Non-Stationary Bandits
- Nonsmooth Optimization — Subgradients and Proximal Methods
- Number Theory for Cryptography
- Oblivious Transfer from Diffie-Hellman
- Online Mechanisms
- Operators on Inner Product Spaces
- Optimization for data analysis
- OS Introduction and the RISC-V ISA
- Paging and Virtual Memory
- Pairing-Based Cryptography
- Parameter Estimation and Binary Hypothesis Testing
- Partial Differential Equations — Heat, Wave, and Laplace
- Partial Monitoring
- Partial Trace and Purification
- Password-Authenticated Key Exchange (PAKE)
- Peer-to-Peer Systems
- Phase-Space Geometry, Fixed Points, and Linearization
- Physical Infrastructure and Wiring
- Physical Protection, Monitoring, and Tamper Resistance
- Polynomial Commitments and Verifiable Secret Sharing
- Polynomials, Invariant Subspaces, and Eigenvalues
- POSIX Threads
- Privacy — Social Networks and Web Tracking
- Privacy Attacks and Motivations for Formal Privacy
- Privacy for Distributed Computing
- Private-Key Encryption and Pseudorandomness
- Processes, System Calls, and Shells
- Profit Maximization in Mechanism Design
- Pseudorandomness — Expander Chernoff and ε-Biased Distributions
- Public-Key Cryptography — Motivation and Key Exchange
- Public-Key Encryption Schemes
- Pure Exploration and Best-Arm Identification
- Quantum Channels — CP Maps and Their Representations
- Quantum Complexity Theory
- Quantum Entropy, Fidelity, and Hypothesis Testing
- Quantum Error Correction and Generalized Measurements (POVMs)
- Quantum Key Distribution — Full Security Proof
- Quantum Measurement and Steering
- Quantum Money and Cryptography with Deletion
- Quantum Oblivious Transfer
- Quantum Query Algorithms — Deutsch-Jozsa and Simon's Algorithm
- Radio Frequency Communication and Modulation
- Random Recurrent Networks and Dynamic Mean-Field Theory
- Ranking Bandits
- Rate Distortion Theory
- Real-World Network Behavior and Datacenter Failures
- Reducibility and Advanced Computability Theory
- Reed-Muller Codes and Polar Codes
- Regev Encryption and Public-Key Encryption of Qubits
- Replicated Data Management and Consistency Models
- Reversible Computation and the No-Cloning Theorem
- Review — Probability, Linear Algebra, and Deep Learning for Generative Models
- Routing Games
- Sampling, Aliasing, and A/D–D/A Conversion
- Schnorr Identification and Signatures
- Second-Order Linear Differential Equations
- Secret Sharing, Multi-Party Protocols, and Computational Differential Privacy
- Security Engineering — Foundations
- Security in Distributed Systems
- Security in Operating Systems
- Self-Stabilizing Systems
- Selfish Load Balancing
- Sigma Protocols and the Fiat-Shamir Transform
- Signals and Systems Basics
- Signcryption and Advanced Signature Topics
- Space Complexity and Savitch's Theorem
- Sphere Packings, Kissing Numbers, and Lattices
- Spiking Neuron and Network Dynamics
- Sponsored Search Auctions
- State Feedback and Linear Quadratic Regulation
- State Machine Replication — Fundamentals
- Stochastic Gradient and Coordinate Descent
- Stochastic Linear Bandits
- Stochastic Processes, Markov Chains, and Stochastic Bandits
- Storage Devices and File Systems
- Stream Cipher Attacks and Case Studies
- Synchronous Byzantine Agreement Protocols
- Tangent Dynamics Through Spikes, Structure, and Advanced Topics
- Tangent Dynamics, Chaos, and Lyapunov Exponents
- Testing a Qubit and Classical Verification of Quantum Computation
- The Asymptotic Equipartition Property
- The Discrete Fourier Transform and the FFT
- The Exp3 and Exp3-IX Algorithms
- The Gaussian Channel
- The HotStuff Family and View Synchronization
- The Inefficiency Of Equilibria
- The Learning With Errors Assumption and the Random Oracle Model
- The Lorenz Equations and One-Dimensional Maps
- The Postulates of Quantum Mechanics and the Qubit
- The Price Of Anarchy And Scalable Resource Allocation Mechanisms
- The Quantum Fourier Transform and Shor's Algorithm
- The Quantum One-Time Pad and Private-Key Encryption of Qubits
- The Separability Problem and Entanglement Witnesses
- The Simplex Family of Protocols
- The z-Transform and System Analysis
- The Zig-Zag Product and SL = L
- Thompson Sampling
- Threshold Cryptography — Signatures, Decryption, and DKG
- Time and Ordering in Distributed Systems
- Time Complexity — P, NP, and NP-Completeness
- Transport-Layer Security and TLS
- Turing Machines and Decidability
- Two-Dimensional Linear Systems and the Phase Plane
- Typicality and Quantum Source Compression
- Unitary Dynamics and Quantum Circuits
- Universal Hashing and the Carter-Wegman MAC
- Universal Source Coding
- Variational Autoencoders
- Vector Spaces and Subspaces
- Web Application and Database Security
- Wireless Sensor Networks
- Zero-Knowledge Proofs
LinkExtendsCitesTopic
Topics
Hover a topic to see its subtopics.
Recent
- Measure Theory An intuition-first build-up of measure theory: why naive length fails (Vitali sets & Banach-Tarski), σ-algebras and the Borel hierarchy, Carathéodory's construction of Lebesgue measure, measurable functions, the Lebesgue integral, convergence theorems, and L^p spaces.
- Additional Public-Key Tools Stub. A few public-key building blocks and attacks beyond the core theory (already covered): building collision-resistant hash functions directly from the discrete-log or RSA assumptions, a man-in-the-middle attack on unauthenticated Diffie-Hellman key exchange, Merkle puzzles (a partial, quadratic-cost solution to key exchange using only a block cipher), and cryptographic accumulators.
- Asynchronous Agreement Protocols Stub. Living with the FLP impossibility (already covered) instead of assuming it away: asynchronous building blocks (Reliable Broadcast, its multi-leader generalization Reliable Gather, and round-complexity results for both); combining binding and randomness to eventually reach agreement; Multi-world Validated Asynchronous Byzantine Agreement; a full series on Binary Asynchronous Agreement (Ben-Or's protocol, a modernized version, Crusader/Binding Crusader Agreement, and solving Binary Byzantine Agreement efficiently from a strong common coin); reaching agreement on a core set; and Verifiable Information Dispersal.