Sign inSign in

Extended Euclidean algorithm

An algorithm used to compute multiplicative inverses in prime fields.
as Christof Paar defines itRuhr University BochumThe wording closest to all 4 definitions
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

    • 23:51Number Theory for PKC: Euclidean Algorithm, Euler's Phi Function & Euler's Theorem
    • 58:27Introduction to Elliptic Curves
  • Ankur Moitra

    MIT · Undergraduate

    An extension of the Euclidean algorithm that keeps track of the linear combinations of the input numbers to find integers s and t such that sa + tb = gcd(a, b).

Lectures that assume it

2

Connections

16

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.