Sign inSign in

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.
as Christof Paar defines itRuhr University BochumThe wording closest to all 3 definitions
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

2

Each in their own terms, from the easiest level.

  • Christof Paar

    Ruhr University Bochum · Undergraduate

  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    The probability that two people in a group share the same birthday, modeled as throwing n balls into m bins.
    • 0:31Birthday Paradox Asymptotics

Lectures that assume it

2

Connections

10

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

2 lecturers. 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.