Chaos and Pseudo-Randomness
نویسندگان
چکیده
We discuss the effect on finite machine implementation of chaotic system on randomness. We show that the most significant bit even for fully developed chaotic systems implemented with high precision (using 1000-bit arithmetics) is not random. We propose chaos-based pseudo-random bit generators and discuss their efficient software implementation.
منابع مشابه
A Pseudo Random Bit Generator Based on Chaotic Logistic Map and its Statistical Testing
During last one and half decade an interesting relationship between chaos and cryptography has been developed, according to which many properties of chaotic systems such as: ergodicity, sensitivity to initial conditions/system parameters, mixing property, deterministic dynamics and structural complexity can be considered analogous to the confusion, diffusion with small change in plaintext/secre...
متن کاملChaotic Test and Non-Linearity of Abnormal Stock Returns: Selecting an Optimal Chaos Model in Explaining Abnormal Stock Returns around the Release Date of Annual Financial Statements
For many investors, it is important to predict the future trend of abnormal stock returns. Thus, in this research, the abnormal stock returns of the listed companies in Tehran Stock Exchange were tested since 2008- 2017 using three hypotheses. The first and second hypotheses examined the non-linearity and non-randomness of the abnormal stock returns ′ trend around the release date of annual fin...
متن کاملAnalysis of FIPS 140-2 Test and Chaos-Based Pseudorandom Number Generator
Pseudo random numbers are used for various purposes. Pseudo random number generators (PRNGs) are useful tools to provide pseudo random numbers. The FIPS 140-2 test issued by the American National Institute of Standards and Technologyhas been widely used for the verifications the statistical properties of the randomness of the pseudo random numbers generated by PRNGs. First this paper analyzes t...
متن کاملA Pseudo Random Number Generator from Chaos
A random number generator is proposed based on a theorem about existence of chaos in fixed point iteration of xn = cot(xn−1). Digital computer simulation of this function iteration exhibits random behavior. A method is proposed to extract random bytes from this simulation. Diehard and NIST test suite for randomness detection is run on this bytes, and it is found to pass all the tests in the sui...
متن کاملA Novel Pseudo Random Bit Generator Based on Chaotic Standard Map and its Testing
During last one and half decade an interesting relationship between chaos and cryptography has been developed, according to which many properties of chaotic systems such as: ergodicity, sensitivity to initial conditions/system parameters, mixing property, deterministic dynamics and structural complexity can be considered analogous to the confusion, diffusion with small change in plaintext/secre...
متن کامل