The wireless channel between Alice and Bob can be exploited as a source of common randomness in order to distil a key. Ideally, all bits are independent from each other and drawn from a Bernoulli (0.5). This implies a truly random key-sequence and the entropy is maximised.

However, this is not always the case. I am interested in measuring the randomness of the key-sequence by using an entropy estimator whose input is a single, long but FINITE sequence.

Is there any default entropy estimator that is used in the literature in the field of physical key generation? If yes, what is the complexity of this algorithm?

More Chrysanthi Paschou's questions See All
Similar questions and discussions