Sign inSign in

Diffie-Hellman problem

The problem of computing gabg^{ab} given gag^a and gbg^b without knowing aa and bb.
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

    The computational problem of finding the shared session key kAB=αabk_{AB} = \alpha^{ab} given the public domain parameters and the public keys AA and BB.
    • 30:09The Generalized Discrete Log Problem and the Security of Diffie-Hellman

Connections

5

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.