| |
| | Dr. Dobb's | Security & PseudoRandom Number Generators | February 2, 2004 |
 | | It's enough that attackers cannot, by brute force, deduce the original entropy (cryptographers tend to use the term "entropy" to mean the actual random data, as well as a measure of its randomness), by comparing output from the PRNG with candidate values of the entropy with the output as observed from the actual PRNG. |
 | | The entropy a data source has given to any knowledge the adversary has (or might have) is known as "conditional entropy," and the entropy ignoring any such knowledge, I call (to avoid confusion) "unconditional entropy." For instance, the entropy of a data source X is written H(X). |
 | | Therefore, I use "unconditional entropy" to mean the amount of entropy a data source has, ignoring any access attackers may have to it; and "conditional entropy" to mean the amount it has given an attacker's potential knowledge. |
| www.ddj.com /184405584 (2118 words) |
|