Sign inSign in
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.
as Christof Paar defines itRuhr University Bochum
Watch it explained

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

1
  • Christof Paar

    Ruhr University Bochum · Undergraduate

    • 3:50SHA-1 Hash Function

Connections

5

The lectures that define it or assume it, and the concepts next to it.

Concepts3

Lectures2

1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.