• Corpus ID: 65649

BiEntropy - The Approximate Entropy of a Finite Binary String

@article{Croll2013BiEntropyT,
  title={BiEntropy - The Approximate Entropy of a Finite Binary String},
  author={G. J. Croll},
  journal={ArXiv},
  year={2013},
  volume={abs/1305.0954}
}
We design, implement and test a simple algorithm which computes the approximate entropy of a finite binary string of arbitrary length. The algorithm uses a weighted average of the Shannon Entropies of the string and all but the last binary derivative of the string. We successfully test the algorithm in the fields of Prime Number Theory (where we prove explicitly that the sequence of prime numbers is not periodic), Human Vision, Cryptography, Random Number Generation and Quantitative Finance. 

Figures and Tables from this paper

A Statistically Significant Test to Evaluate the Order or Disorder for a Binary String of a Finite Length
TLDR
The paper presents a solution to the analysis of a finite binary string that is based on the KullbackLeibler Divergence (or Relative Entropy) which yields a measure of how one probability distribution is different from another reference probability distribution.
A Statistically Significant Test to Evaluate the Order or Disorder of a Binary String
TLDR
The paper presents a solution to the analysis of a finite binary string that is based on the Kullback-Leibler Divergence (or Relative Entropy) which yields a measure of how one probability distribution is different from another reference probability distribution.
BiEntropy, TriEntropy and Primality
TLDR
A significant relationship between BiEntropy and TriEntropy is found such that the twin primes conjecture is true and the BiEntropic prime density is shown to be quadratic with a very small Gaussian distributed error.
The BiEntropy of Some Knots on the Simple Cubic Lattice
TLDR
It is shown that the non-alternating knots of nine and ten crossings are more disordered than the alternating knots ofNine andTen crossings.
Enhanced Generic Architecture for Safety Increase of True Random Number Generators
: Conventionally used generic architecture of true random number generators does not allow testing of random numbers during their generation. This paper introduces an extension of the conventionally
On the Chirp Function, the Chirplet Transform and the Optimal Communication of Information
TLDR
It is shown that application of chirplet modulation can provide a simple and optimal solution to the problem of transmitting binary strings through noisy communication channels, a result which suggests that all digital communication systems should ideally by predicated on the application of Chirplets modulation.
Physical layer key agreement under signal injection attacks
  • Rong Jin, K. Zeng
  • Computer Science
    2015 IEEE Conference on Communications and Network Security (CNS)
  • 2015
TLDR
This paper shows that signal injection attack is feasible in practice and leads to a strong correlation between the injected signal and channel measurements at legitimate users for existing key generation methods, and proposes a countermeasure, PHY-UIR (PHYsical layer key agreement with User Introduced Randomness).
Hiding Cryptographic Keys of Embedded Systems
TLDR
This paper proposes different methods to protect cryptographic keys of embedded systems based on software protection techniques taking into account the attacker's reverse engineering perspective, and conducts a case study that shows the difficulty to disclosure cryptographic keys hidden by the proposed methods.
Tell Them from Me: An Encrypted Application Profiler
TLDR
This paper proposes a machine-learning based solution for creating encrypted application signatures without relying on any certain assumptions on the underlying network infrastructure such as IP address, port number, network flow characteristics, so that machine learning algorithms can be used to identify encrypted applications.
MagPairing: Pairing Smartphones in Close Proximity Using Magnetometers
TLDR
A new method, called MagPairing, for pairing smartphones in close proximity by exploiting correlated magnetometer readings, which exploits the fact that smartphones are equipped with tiny magnets.
...
...

References

SHOWING 1-10 OF 43 REFERENCES
Approximate entropy for testing randomness
  • A. Rukhin
  • Computer Science
    Journal of Applied Probability
  • 2000
TLDR
To derive the limiting distribution of approximate entropy, it is shown that the approximate entropy as well as its modified version converges in distribution to a χ2-random variable.
Testing for randomness in stream ciphers using the binary derivative
TLDR
A uniform method of testing randomness in binary strings is described based on using the binary derivative and it is shown that the new tests are faster and more powerful than several of the well-established tests for randomness.
On the Length of Programs for Computing Finite Binary Sequences
TLDR
An application to the problem of defining a patternless sequence is proposed in terms of the concepts here developed to study the use of Turing machines for calculating finite binary sequences.
Approximate entropy as a measure of system complexity.
  • Steven M. Pincus
  • Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 1991
TLDR
Analysis of a recently developed family of formulas and statistics, approximate entropy (ApEn), suggests that ApEn can classify complex systems, given at least 1000 data values in diverse settings that include both deterministic chaotic and stochastic processes.
Not all (possibly) "random" sequences are created equal.
  • S. Pincus, R. Kálmán
  • Mathematics
    Proceedings of the National Academy of Sciences of the United States of America
  • 1997
TLDR
This work assess randomness via approximate entropy (ApEn), a computable measure of sequential irregularity, applicable to single sequences of both finite and infinite length, and indicates the novelty and facility of the multidimensional viewpoint taken by ApEn, in contrast to classical measures.
Random numbers fall mainly in the planes.
  • G. Marsaglia
  • Mathematics, Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 1968
TLDR
The paper gives details of the degree of regularity of congruential random number generators in terms of sets of relatively few parallel hyperplanes which contain all of the points produced by the generator.
Estimating the Entropy of Binary Time Series: Methodology, Some Theory and a Simulation Study
TLDR
It is proved that, like their earlier versions, the two new LZ-based estimators are universally consistent, that is, they converge to the entropy rate for every finite-valued, stationary and ergodic process.
Randomness and degrees of irregularity.
  • S. Pincus, B. Singer
  • Mathematics, Computer Science
    Proceedings of the National Academy of Sciences of the United States of America
  • 1996
TLDR
ApEn (approximate entropy), defining maximal randomness for sequences of arbitrary length, indicating the applicability to sequences as short as N = 5 points, and an infinite sequence formulation of randomness is introduced that retains the operational (and computable) features of the finite case.
A Mathematical Theory of Communication
TLDR
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.
A Short Introduction to Bit-String Physics
This paper starts with a personal memoir of how some significant ideas arose and events took place during the period from 1972, when I first encountered Ted Bastin, to 1979, when I proposed the
...
...