Sign inSign in

Yao's XOR lemma

A cryptographic tool that turns a slightly hard function into a very hard function by XORing multiple independent inputs.
as Ryan O'Donnell defines itCarnegie Mellon University
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

1
  • Ryan O'Donnell

    Carnegie Mellon University · Graduate

    • 1:17Hardness Amplification

Connections

9

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

Concepts7

Show 1 more

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.