Quoted By:
Alright, I'll word my real question without ambiguity. I have heard that it is a goal of cryptographers to make their algorithms such that the encrypted data output is indistinguishable from random data. I want to know how I can distinguish data from random data. I assumed that it was possible to simply measure the amount of entropy of a chunk of data, and compare it to what you'd expect from the entropy of a chunk of random data, but it seems this measurement is not straightforward.
