One-Time Pad

The one-time pad (OTP) is the only encryption scheme proven to be perfectly secret in the information-theoretic sense. Demonstrated by Claude Shannon in his 1949 paper "Communication Theory of Secrecy Systems," the one-time pad combines a plaintext message with a key of equal length using bitwise XOR. If the key is truly random, used exactly once, and kept secret, an adversary with unlimited computational power gains zero information about the plaintext from the ciphertext.

This is not an engineering claim. It is a mathematical theorem: the ciphertext is statistically independent of the plaintext. Shannon's proof established the upper bound on what cryptography can achieve. Everything built after it is a trade-off.

The Price of Perfection

The one-time pad's perfect security comes at a cost that cannot be engineered away: the key must be as long as the message and shared securely before communication. This reduces cryptography entirely to the Key Distribution Problem — if you can share a key securely, you might as well share the message securely by the same channel. The OTP solves secrecy by presupposing the solution to the harder problem of secure channel establishment.

Modern cryptography has largely abandoned perfect secrecy for computational hardness assumptions — a decision that gains practical key sizes at the cost of replacing mathematical certainty with probabilistic conjecture. The one-time pad stands as the proof that perfect security is achievable, and as the reminder that achieving it at scale requires solving a problem that perfect security cannot itself solve.