ConceptSystems & CS
Discrete log problem
Given a multiplicative group of integers mod a prime, a generator , and an element h = gˣ pmod p, find .
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
2Each in their own terms, from the easiest level.
Nickolai Zeldovich
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
5The lectures that define it or assume it, and the concepts next to it.