|
|
|
|
|
by dsacco
3262 days ago
|
|
> Not coincidentally, 2^n is also the number of possible one-time pads there are, so your adversary gains no information from this fact. Yes! And this is what's critical to the success of the one-time pad: you've not just encrypted data, you've encrypted data in such a fashion that (from the attacker's perspective), all plaintexts they recover are equally likely. Cryptanalysis is fundamentally impossible. The information theory is absolutely groovy, but the application of it is unfortunately impractical. |
|