Different Flavours of HILL Pseudoentropy and Yao Incompressibility Entropy

ePrint Report: Different Flavours of HILL Pseudoentropy and Yao Incompressibility Entropy

Pihla Karanko

There are two popular ways to measure computational entropy in cryptography: (HILL) pseudoentropy and (Yao) incompressibility entropy. Both of these computational entropy notions are based on a natural intuition.


- A random variable $X$ has $k$ bits of pseudoentropy if there exists a random variable $Y$ that has $k$ bits 'real' entropy and $Y$ is computationally indistinguishable from $X$.
- A random variable $X$ has $k$ bits …

bits computational cryptography entropy eprint report intuition measure natural popular random report variable