8 Jul
2003
8 Jul
'03
9:31 p.m.
Just curious to hear the opinions of the many wise people here...
What is the likelihood of an encryption system in which the resulting data
has no pattern, and one character of encrypted data may stand for many
different characters when decrypted?
8 Jul
8 Jul
10:29 p.m.
On Tue, 08 Jul 2003 15:31:08 GMT, John P. Willis <jwillis(a)coherent-logic.com>
wrote:
Just curious to hear the opinions of the many wise people here...
What is the likelihood of an encryption system in which the resulting data
has no pattern,
Such a thing exists, it is called a one-time pad. Generate a
completely random key as long as the plaintext, and then XOR each
successive bit of the key with the corresponding bit of the plaintext.
The result is indistinguishable from random noise; only someone with
an identical copy of the key can decrypt it (using precisely the same
method of course).
and one character of encrypted data may stand for
many
different characters when decrypted?
Assuming you mean "one character of encrypted data might represent any
one of several different characters of plaintext" (not "one
character's worth of encrypted data represents multiple characters
worth of plaintext), this is indeed the effect of a one-time pad.
Just don't ever reuse that key; promptly destroy both copies after
use.
--Mirian
11:35 p.m.
Is it possible to do this with a fixed length key?
Such a thing exists, it is called a one-time pad.
Generate a
completely random key as long as the plaintext, and then XOR each
successive bit of the key with the corresponding bit of the plaintext.
The result is indistinguishable from random noise; only someone with
an identical copy of the key can decrypt it (using precisely the same
method of course).
--Mirian
_______________________________________________
TUHS mailing list
TUHS(a)minnie.tuhs.org
http://minnie.tuhs.org/mailman/listinfo/tuhs
7838
days inactive
7838
days old
2 comments
3 participants
participants (3)
-
Joel Martinez -
John P. Willis -
list-tuhs＠cosmic.com