Beta Phase: Square45 is currently in beta testing. Expect some features or content to be incomplete or missing.
45

One-Time Pad (OTP)

A theoretically unbreakable encryption method using a random key that is as long as the message, discarded after one use.
📜

The statement of the theorem

Let MM be the plaintext message, KK be the key, and CC be the ciphertext, all defined over a finite field F2L\mathbb{F}_2^L (vectors of length LL). The key KK must satisfy K∈F2LK \in \mathbb{F}_2^L and be uniformly random and never reused. The encryption operation E\mathcal{E} and decryption operation D\mathcal{D} are defined using the XOR operation (⊕\oplus):\nEncryption: C=M⊕K\text{Encryption: } C = M \oplus K \nDecryption: M=C⊕K\text{Decryption: } M = C \oplus K \nSince KK is uniformly random and independent of MM, the resulting ciphertext CC is statistically indistinguishable from a uniform random sequence, ensuring perfect secrecy (Shannon's perfect secrecy).
Source: Wikipedia