ConceptTheory & Algos
NP-completeness in cryptography
Cryptographic systems like RSA are often based on problems that are hard in the worst case but not known to be NP-complete, unlike graph 3-coloring which is NP-complete.
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.
Lecturers
1Connections
4The lectures that define it or assume it, and the concepts next to it.