Sign inSign in
ConceptSystems & CS

Repeated squaring

An algorithm that computes powers of a matrix by repeatedly squaring the matrix, reducing the number of multiplications to logarithmic time.
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.

  • Nickolai Zeldovich

    MIT · Undergraduate

    An algorithm for modular exponentiation that computes C2XC^{2X} by computing CXC^X and squaring it, reducing the number of multiplications required.
    • 25:18Side-Channel Attacks

Lectures that assume it

1

Connections

11

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.