Shannon entropy

A measure, in bits per character, of how unpredictable a string is, used to tell random-looking tokens from ordinary text.

In more detail

Random tokens score high and English words low, but UUIDs and hashes score high too. That is why a secret rule needs a pattern for the token format as well as an entropy floor such as 3.5.

Related terms

Taught in

References