Sign inSign in

NP-completeness in cryptography

Cryptographic systems like RSA are often based on problems that are hard in the worst case but not known to be NP-complete, unlike graph 3-coloring which is NP-complete.
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.

Lecturers

1

    Connections

    4

    The lectures that define it or assume it, and the concepts next to it.

    Concepts3

    Lecture1

    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.