ConceptTheory & Algos
Extended Euclidean algorithm
An algorithm used to compute multiplicative inverses in prime fields.
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
2Each in their own terms, from the easiest level.
Christof Paar
Ankur Moitra
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
2Connections
16The lectures that define it or assume it, and the concepts next to it.