Sign inSign in
ConceptSystems & CS

RSA

A public-key cryptosystem based on the practical difficulty of factoring the product of two large prime numbers.
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.

Modular arithmetic2Euler's totient theorem1Integer factorization1Prime number1

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

    A public-key cryptosystem that uses two large prime numbers to generate a key pair for encryption and decryption.
    • 6:04Side-Channel Attacks

Lectures that assume it

2

Connections

10

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.