... Davis¹

Department of Computer Science, Johns Hopkins University, Baltimore, Maryland, USA; ddavis@cs.jhu.edu

... Monrose²

Department of Computer Science, Johns Hopkins University, Baltimore, Maryland, USA; fabian@cs.jhu.edu

... Reiter³

Department of Electrical & Computer Engineering, Department of Computer Science, and CyLab, Carnegie Mellon University, Pittsburgh, Pennsylvania, USA; reiter@cmu.edu

... known.⁴

For a random variable $X$ taking on values in ${\cal X}$, if $G(X)$ denotes its guessing entropy and $H(X)$ denotes its Shannon entropy, then it is known that $G(X) \ge 2^{H(X)-2} + 1$ [18] and that $H(X) \ge \frac{2\log \vert{\cal X}\vert}{\vert{\cal X}\vert-1} (G(X)-1)$ [19].