Sign inSign in

Square root attacks

General attacks on elliptic curve discrete logarithm problems that have a time complexity proportional to the square root of the group order.
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.

Opens up

Concepts that name this one as a prerequisite.

Lecturers

1
  • Christof Paar

    Ruhr University Bochum · Undergraduate

    • 1:11:16The 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.

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.