Sign inSign in

Brute-force attack on the discrete logarithm problem (DLP)

A brute-force attack on the DLP tries all possible values of x sequentially to find the one that satisfies αx=β\alpha^x = \beta.
as Christof Paar defines itRuhr University Bochum
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

1

    Connections

    3

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

    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.