On the Incomparability of Entropy and Marginal Guesswork in Brute-Force Attacks
Date: December 2000
Publication: First International Conference in Cryptology in India, INDOCRYPT 2000
Page(s): 67 - 79
Source 1: http://www.atbash.com/sites/default/files/Pliam%20Indocrypt00.pdf
Source 2: http://dx.doi.org/10.1007/3-540-44495-5_7 - Subscription or payment required
Abstract or Summary:
We discuss measures of statistical uncertainty relevant to determining random values in cryptology. It is shown that unbalanced and self-similar Huffman trees have extremal properties with respect to these measures.Their corresponding probability distributions exhibit an unbounded gap between (Shannon)entropy and the logarithm of the minimum search space size necessary to be guaranteed a certain chance of success (called marginal guesswork). Thus, there can be no general inequality between them. We discuss the implications of this result in terms of the security of weak secrets against brute-force searching attacks, and also in terms of Shannon’s uncertainty axioms.
Do you have additional information to contribute regarding this research paper? If so, please email firstname.lastname@example.org with the details.