Sign inSign in

Proof of correctness

A mathematical demonstration that a decryption procedure correctly recovers the original plaintext from the ciphertext.
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.

Lecturers

1
  • Christof Paar

    Ruhr University Bochum · Undergraduate

    • 10:13Diffie-Hellman Key Exchange and the Discrete Log Problem

Connections

5

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

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.