ConceptSystems & CS
Birthday paradox attack complexity
The reduced complexity of finding hash collisions using the birthday paradox, scaling as the square root of the output space size.
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
1Christof Paar
Connections
5The lectures that define it or assume it, and the concepts next to it.