🚀 go-pugleaf

These days it is quite common to compress text (and other files too.)
The various compressions schemes such as Huffman encoding and Lempel-
Ziv-Welch tend to even out (smooth out) the character distribution
(i.e., they hope to maximize the information transmitted per character,
or per byte).  If this file is then encrypted, the smoothness may
end up in the encrypted data.  

Conversly, random data need not have a smooth character distribution.
(It is common to confuse "random" with "equi-probable".  However, even
though most examples given in courses of "random" are "equi-probable
there is no necessary connection.)

--henry schaffer  n c state univ