New answers tagged

3 votes

Perfect Secrecy other than One-time Pad

There is a famous result about perfect secrecy, usually called Shannon's theorem: If an encryption scheme has perfect secrecy, then $|\mathcal{K}| \ge |\mathcal{M}|$, where $\mathcal{K}$ is the set ...
Mikero's user avatar
  • 11.6k
0 votes

Perfect Secrecy other than One-time Pad

There's computational perfect secrecy and information-theoretic perfect secrecy, and OTP belongs to the latter. If it's well-known information-theoretic perfect secrecy that you seek and is no less ...
DannyNiu's user avatar
  • 8,648
-1 votes

How were one-time pads and keys historically generated?

This procedure, though not entirely random theoretically, did serve as one-time pad generator. At the exhibition, besides many interesting encryption machines, a copy of the book “Achtung Spione” was ...
Schezuk's user avatar
  • 153

Top 50 recent answers are included