ConceptTheory & Algos
Modular arithmetic
A system of arithmetic for integers where numbers wrap around after reaching a certain value called the modulus.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Opens up
Concepts that name this one as a prerequisite.
Lecturers
5Each in their own terms, from the easiest level.
Vicky Neale
Arithmetic system for integers where numbers wrap around after reaching a certain value called the modulus.Christof Paar
Computation performed within finite sets using specific rules like clock arithmetic.Ankur Moitra
About relationships between numbers where you keep track of remainders when you divide by a number.Ryan O'Donnell
Arithmetic system for integers where numbers wrap around after reaching a certain value called the modulus.
Lectures that assume it
47The first 12 are shown.
- Stream Ciphers and Linear Feedback Shift Registers
- The Complexity Class coNP
- Randomized Complexity: RP, coRP, and ZPP
- Randomization: Matrix Multiply, Quicksort
- Bit Hacks
- Stream Ciphers, Random Numbers and the One Time Pad
- The RSA Cryptosystem and Efficient Exponentiation
- Elliptic Curve Cryptography (ECC)
- Symmetric Key Establishment and Kerberos Protocol
- Basic Group Theory
- Cryptography: Encryption
- Table Doubling, Karp-Rabin
Connections
58The lectures that define it or assume it, and the concepts next to it.
Concepts6
Lectures52
- Binary Relations, Partitions & Equivalence Relations
- Toda's 1st Theorem and the Permanent
- Number Theory II
- Modular Arithmetic and Historical Ciphers
- Modular Arithmetic
- Stream Ciphers and Linear Feedback Shift Registers
Show 46 moreShow fewer
- The Complexity Class coNP
- Randomized Complexity: RP, coRP, and ZPP
- Randomization: Matrix Multiply, Quicksort
- Bit Hacks
- Stream Ciphers, Random Numbers and the One Time Pad
- The RSA Cryptosystem and Efficient Exponentiation
- Elliptic Curve Cryptography (ECC)
- Symmetric Key Establishment and Kerberos Protocol
- Basic Group Theory
- Cryptography: Encryption
- Table Doubling, Karp-Rabin
- Randomization: Universal & Perfect Hashing
- Digital Signatures and Security Services
- The Fourier Transform over Z_n
- Number Theory for PKC: Euclidean Algorithm, Euler's Phi Function & Euler's Theorem
- Shor's Factoring Algorithm
- Cryptography: Hash Functions
- Primes and Prime Fields
- Multivariate Polynomials and the Schwartz Zippel Lemma
- Razborov Smolensky Lower Bounds for AC0[p]
- Structure and Randomness in the Prime Numbers
- Diffie-Hellman Key Exchange and the Discrete Log Problem
- The Generalized Discrete Log Problem and the Security of Diffie-Hellman
- Elgamal Encryption Scheme
- Elgamal Digital Signature
- Period-Finding (Simon's Algorithm over Z_N)
- Cognitive Science Tools for Understanding LLM Behavior
- Number Theory I
- Side-Channel Attacks
- Introduction to Elliptic Curves
- Introduction to Hash-based Post-quantum Cryptography (PQC)
- Processing Inside NAND Flash Memory
- Revealing XOR-patterns I
- ImageNet and Convolutional Neural Networks
- Probabilistic Computation
- Learning With Errors (LWE) and Public Key Encryption
- Toda's Second Theorem and Lower Bounds for Uniform ACC
- Quantum Query Complexity
- The Hidden Subgroup Problem
- Introduction to Galois Fields for the AES
- Anonymous Communication
- UG-Hardness Results from Dictator Tests
- The Complexity of Simplicity in Mathematical Logic
- On the Strong Density Conjecture for Apollonian Circle Packings
- Expander Graph Constructions
- (Re)imagining Mathematics in a World of Reasoning Machines