New answers tagged

0

under perfect encryption y (output)= x(input) + z (key) As long as the key is a random (perfect random) then (Entropy of the output) H(y)= H(z) and therefore the output is not compressible. if the key is a sudo-random in general, the output is compressible the max (H(z), H(x)) A single output stream , might have a very simple representation, such as all ...


2

You're simply confusing the entropy rate of a sequence with it's entire entropy content. And that depends on the sequence's encoding. The base64 version of a sequence is 33–36% larger than it might be if it were pure binary. And that consequently decreases the maximum possible entropy rate to your 5.9 bits/char. We could jump into entropy measurements, but ...


Top 50 recent answers are included