One Time Pad - Complete confidentiality

• For every message M’, there is a key K’, such that M’?K’=C

• Example:

  • CipherText is “1011”.
  • For each possible ClearText, exists appropriate Key.

• Without the knowledge of the key, the CipherText implies nothing on the ClearText.

Previous slide

Next slide

Back to first slide

View graphic version