• Corpus ID: 11625686

ENTROPY BOUNDS AND STATISTICAL TESTS

@inproceedings{Hagerty2010ENTROPYBA,
  title={ENTROPY BOUNDS AND STATISTICAL TESTS},
  author={Patrick Hagerty and Thomas G. Draper},
  year={2010}
}
We convert a generic class of entropy tests from pass/fail to a measure of entropy. The conversion enables one to specify a fundamental design criterion: state the number of outputs from a noise source required to satisfy a security threshold. We define new entropy measurements based on a three-step strategy: 1) compute a statistic on raw output of a noise source, 2) define a set of probability distributions based on the result, and 3) minimize the entropy over the set. We present an efficient… 

Figures and Tables from this paper

On the Efficient Estimation of Min-Entropy

This paper proposes a min-entropy estimator based on Coron’s test that is computationally more efficient than the compression estimator while maintaining the estimation accuracy and a lightweight estimator that processes data samples in an online manner.

Generalized LRS Estimator for Min-entropy Estimation

Two techniques to estimate the min-entropy of a non-IID source accurately are proposed and a generalized LRS estimator is proposed that effectively resolves the overestimation problem and provides stable min-Entropy estimates.

Generalized Longest Repeated Substring Min-Entropy Estimator

Two techniques to estimate the min-entropy of a non-IID source accurately are proposed and a generalized LRS estimator is proposed that effectively resolves the overestimation problem and provides stable min-Entropy estimates.

On the Analysis and Improvement of Min-Entropy Estimation on Time-Varying Data

The proposed entropy estimation framework adopting change detection techniques to address the problem of compromised RNGs employs a change detection method to preprocess the tested data and adds additional distribution features to each data sample, which makes it possible to learn the distribution changes and estimate the entropy more accurately.

Analysis and Improvement of Entropy Estimators in NIST SP 800-90B for Non-IID Entropy Sources

It is proved that the Collision Estimate and the Compression Estimate in non-IID track could provide significant underestimates in theory and proposed a new estimator to approximate the result of this formula, which gives close estimates to the real min-entropy.

Predictive Models for Min-entropy Estimation

Random numbers are essential for cryptography and if the entropy source provides less unpredictability than is expected, the security of the cryptographic mechanisms is undermined, as in [5, 7, 10].

Min-entropy estimation for semiconductor superlattice true random number generators

A min-entropy estimation method is proposed in this paper for the SSL-TRNG by extending the Markov stochastic model derived from the memory effects, and the experimental results show that the estimator is accurate enough to adjust compression rate dynamically in post-processing to reach the required security level.

High-Efficiency Min-Entropy Estimation Based on Neural Network for Random Number Generators

This work proposes several new and efficient approaches for min-entropy estimation by using neural network technologies and design a novel execution strategy for the proposed entropy estimation to make it applicable to the validation of both stationary and nonstationary sources.

Entropy Estimation of Physically Unclonable Functions

This paper found that arranging the PUF responses in readout order results in the overestimation of the min-entropy, and used numerical simulation to create numerical PUFs with the entropy-loss source, demonstrating that the entropy estimation suite overestimates their entropy.

Entropy Estimation of Physically Unclonable Functions with Offset Error

An entropy prediction scheme is proposed that considers entropy-loss sources (offset error) and it is shown through experiments that the proposed scheme more accurately estimates the min-entropy of PUFs.

References

SHOWING 1-6 OF 6 REFERENCES

A universal statistical test for random bit generators

  • U. Maurer
  • Computer Science, Mathematics
    Journal of Cryptology
  • 2004
A new statistical test for random bit generators is presented which can detect any significant deviation of a device's output statistics from the statistics of a truly random bit source when the device can be modeled as an ergodic stationary source with finite memory but arbitrary (unknown) state transition probabilities.

Probability inequalities for sum of bounded random variables

Abstract Upper bounds are derived for the probability that the sum S of n independent random variables exceeds its mean ES by a positive number nt. It is assumed that the range of each summand of S

A Mathematical Theory of Communication

It is proved that the authors can get some positive data rate that has the same small error probability and also there is an upper bound of the data rate, which means they cannot achieve the data rates with any encoding scheme that has small enough error probability over the upper bound.

Handbook of Mathematical Functions With Formulas, Graphs and Mathematical Tables (National Bureau of Standards Applied Mathematics Series No. 55)

A handbook of mathematical functions that is designed to provide scientific investigations with a comprehensive and self-contained summary of the mathematical functions that arise in physical and

On measures of information and entropy

  • Proceedings of the 4th Berkeley Symposium on Mathematics, Statistics and Probability
  • 1960

Shannon . A Mathematical Theory of Communication

  • Proceedings of the 4 th Berkeley Symposium on Mathematics , Statistics and Probability
  • 1960