4.6 Article

Selecting an Effective Entropy Estimator for Short Sequences of Bits and Bytes with Maximum Entropy

Journal

ENTROPY
Volume 23, Issue 5, Pages -

Publisher

MDPI
DOI: 10.3390/e23050561

Keywords

entropy; estimation; cryptography; randomness; undersample

Ask authors/readers for more resources

By comparing different estimators, the study experimentally determines the most suitable estimator for estimating the entropy of bytes and bits in short samples.
Entropy makes it possible to measure the uncertainty about an information source from the distribution of its output symbols. It is known that the maximum Shannon's entropy of a discrete source of information is reached when its symbols follow a Uniform distribution. In cryptography, these sources have great applications since they allow for the highest security standards to be reached. In this work, the most effective estimator is selected to estimate entropy in short samples of bytes and bits with maximum entropy. For this, 18 estimators were compared. Results concerning the comparisons published in the literature between these estimators are discussed. The most suitable estimator is determined experimentally, based on its bias, the mean square error short samples of bytes and bits.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.6
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available