In article <806453.762.1334626216281.JavaMail.geo-discussion-forums@vbuo5>,
This is a very subtle question, and it's hard to
answer it when you don't have the correct
understanding in the first place.
The plaintext was some file which presumably had
some sort of redundancy in it (like text or a
program or a picture...), and when you try to
measure the entropy of that file, you would get
some number that is less than the number of bits
in the file.
Now the file is encrypted by XORing it with
another file F1 that is full of random-looking
data (that is, it appears to have full entropy).
The resulting ciphertext will also appear to have
full entropy, assuming that there was no
pre-existing correlation between the plaintext and
F1.
Now you XOR the ciphertext with F2, which is also
full of random-looking data, and isn't correlated
F1. The result is going to be the same as XORing
the plaintext with some third random-looking file
F3, where F3 = F1 XOR F2. F3 will also be
random-looking. So the entropy of this result will
also appear to be high (ie. random looking).
The only way you'll get a result that doesn't
appear to have full entropy is if two of the files
are correlated to each other. Usually this will be
because F1 == F2, and you decrypted. Alternatively
you might have some buggy random file generator
that left you with different (but correlated) F1
and F2.
I don't know if that helped or not.
Greg.
--