The document describes the one-time pad cipher, which is considered theoretically unbreakable. It works by combining a plaintext message with a randomly generated key that is at least as long as the message. Each character of the key is combined with the corresponding character of the message using modular arithmetic. The key is then destroyed after use, and both the sender and receiver must have identical copies of the key to encrypt and decrypt messages. It provides perfect secrecy because an attacker with infinite computing power could not determine the original plaintext without the key.