One-Time Pad is Unbreakable

From ProofWiki
Jump to navigation Jump to search

Theorem

Let $M$ be a message encoded using a one-time pad.

Then without the key, it is not possible to decode $M$.


Proof




Sources