Unicity Distance
Contents
- $q$ - Radix
- $H_q(K)$ - Radix $q$ entropy of $K$
- $H_q(K) = log_q|K|$
- $K$ - Key space (Number of keys)
- $r_n$ - Average entropy per symbol
- $r_n = H_q(K_n)/n$
- $d_n = 1 - r_n$
General Case
$n_0 = \ceil(log_2(|K|) / 3.2)$
$n_0 = \ceil(log_2(|K|) / 3.2)$