crypto

We recap the usual OTP with encryption in $\{0,1{\}}^n$ being $m\oplus K$ and note how its slogan “every ciphertext can come from any plaintext” justifying its security is just a consequence of the group structure in $\{0,1{\}}^n$. We then formulate the more general OTP over groups.