Re:Entropy isn't sufficient to measure password strength
by lmm on Monday January 17, 2022 @01:14AM
(#29963844)
It's easy to calculate an upper bound on the Kolmogorov complexity of a given value (you just have to exhibit a Turing machine that computes it), but very hard to prove a lower bound (you would have to prove something about all possible Turing machines).
[ Parent
| on HN ]
There are no comments on this comment yet.