Thread View: sci.crypt
2 messages
2 total messages
Started by Bob Devine
Thu, 18 Dec 1986 02:43
Multiple "valid" decryptions
Author: Bob Devine
Date: Thu, 18 Dec 1986 02:43
Date: Thu, 18 Dec 1986 02:43
14 lines
1044 bytes
1044 bytes
Something to reflect upon, when thinking about decrypting a message using a key with a very large range, is the large number of possible decryptions that may result. Obviously, most of the decryptions when using a random key will be garbage. However, what's intriguing is the thought that some of the random keys will produce random interesting messages. For comparison, what were the odds in the old puzzle about 100 monkees coming up with Shakespearean plays after hammering randomly on typewriters for a million years? Bob Devine [ encrypting my name produces 13013...:-)]
Re: Multiple "valid" decryptions
Author: Bruce McNair
Date: Fri, 19 Dec 1986 19:17
Date: Fri, 19 Dec 1986 19:17
15 lines
1234 bytes
1234 bytes
> > Something to reflect upon, when thinking about decrypting a message > using a key with a very large range, is the large number of possible > decryptions that may result. Obviously, most of the decryptions > when using a random key will be garbage. However, what's intriguing > is the thought that some of the random keys will produce random > interesting messages. > Bob Devine > [ encrypting my name produces 13013...:-)] The whole strength of the "one time pad" cryptosystem (the only publically known, provably secure against all attacks cryptosystem) is based on that fact - a cipher can be decrypted into any of 2**n plaintexts (for an n bit message) and all are equally plausible plaintexts, given the cipher.
Thread Navigation
This is a paginated view of messages in the thread with full content displayed inline.
Messages are displayed in chronological order, with the original post highlighted in green.
Use pagination controls to navigate through all messages in large threads.
Back to All Threads