Comment by SideQuark

> A hash is as secure as its _strongest_ entropy source provided that none of the inputs can snoop on the others

A hash is as secure as the entropy used to make it. That entropy is the sum of the entropy sources, if they do not share information. If they do, and you can accurately model the partials, then you can compute how much entropy is in the result. Using the entropy from a pool reduces it, and over time the input sources are analyzed to know if there’s enough in the pool to perform a requested operation.

Has no one in this tread actually learned basic information theory at the level of Cover?

> This is superstitious nonsense….

You are confusing entropy with complexity. Simply google “ what is the difference between entropy and complexity in cryptography” and it clearly shows you’re confused.

Entropy is the unpredictability in a source of information. How hard it is to exhaust a space by attack is complexity. These are fundamentally different concepts in both information theory and cryptography.