DocumentCode :
3282231
Title :
A study on occurrence rates per bit for the logistic map over integers
Author :
Araki, Shunsuke ; Miyazaki, Takeru ; Uehara, Satoshi
Author_Institution :
Grad. Sch. of Comput. Sci. & Syst. Eng., Kyushu Inst. of Technol., Iizuka
fYear :
2008
fDate :
7-10 Dec. 2008
Firstpage :
1
Lastpage :
5
Abstract :
We are investigating the logistic map over integers with finite precisions and sequences out-putted by the iterative mapping. In our proposed simple pseudo-random number generator with the logistic map over integers, we implicitly assumed that 0 and 1 occurrence frequencies per bit of outputs by the map are nearly equal. By some numerical experiments, we got the conjecture that occurrence rates per bit are nearly equal for many bits of 2n-bit values in the intermediate step of the map by one iteration and many iterations.
Keywords :
chaos; random number generation; integers; iterative mapping; logistic map; occurrence rates per bit; pseudo-random number generator; Application software; Chaos; Computer science; Cryptography; Equations; Frequency; Information theory; Logistics; Random number generation; Systems engineering and theory;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Information Theory and Its Applications, 2008. ISITA 2008. International Symposium on
Conference_Location :
Auckland
Print_ISBN :
978-1-4244-2068-1
Electronic_ISBN :
978-1-4244-2069-8
Type :
conf
DOI :
10.1109/ISITA.2008.4895616
Filename :
4895616
Link To Document :
بازگشت