Sign inSign in
ConceptSystems & CS

Discrete log problem

Given a multiplicative group of integers mod a prime, a generator gg, and an element h = gˣ pmod p, find xx.
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.

Lecturers

2

Each in their own terms, from the easiest level.

  • Nickolai Zeldovich

    MIT · Undergraduate

    A mathematical problem where it is computationally difficult to determine the exponent given the base and the exponentiated value, providing security in Diffie-Hellman.

Connections

5

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

Concepts3

Lectures2

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.