ConceptTheory & Algos
Birthday paradox
A probability principle implying that an attack on a hash function requires roughly half the bit length of security steps to find a collision.
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
2Each in their own terms, from the easiest level.
Christof Paar
Ryan O'Donnell
The probability that two people in a group share the same birthday, modeled as throwing n balls into m bins.
Lectures that assume it
2Connections
10The lectures that define it or assume it, and the concepts next to it.