Computational measurements of the transient time and of the sampling distance that enables statistical independence in the logistic map

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 5593 LNCS, Issue PART 2, 2009, Pages 703-718

  Vlad, Adriana ^a,b   Luca, Adrian ^a   Frunzete, Madalin ^a  

^a UNIVERSITY POLITEHNICA OF BUCHAREST   (Romania)

^b ACADEMY OF ROMANIAN SCIENTISTS   (Romania)

Author keywords

Kolmogorov and Smirnov tests; Logistic map; Statistical independence in chaotic maps; Statistical independence test; Transient time

Indexed keywords

KOLMOGOROV AND SMIRNOV TESTS; LOGISTIC MAP; STATISTICAL INDEPENDENCE IN CHAOTIC MAPS; STATISTICAL INDEPENDENCE TEST; TRANSIENT TIME;

CAPACITANCE; COMPUTATIONAL COMPLEXITY; FUNCTION EVALUATION; LYAPUNOV METHODS; SAMPLING; STATISTICAL TESTS; STATISTICS;

CHAOTIC SYSTEMS;

EID: 70350635793     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-02457-3_59     Document Type: Conference Paper

References (11)

1. Baptista, M.S.: Cryptography with chaos. Physics Letters A 240, 50-54 (1998)
2. Lévine, B.: Fondements Théoriques de la Radiotechnique Statistique. Tome II, Edition Mir, Moscou (1973)
3. Mihoc, G., Urseanu, V.: Matematici Aplicate în statisticǎ (in Romanian). Ed. Academiei, Bucuresti (1962)
4. Beyer, W.H.: Handbook of Tables for Probability and Statistics, 2nd edn. CRC Press, Boca Raton (2000)
5. Kanso, A., Smaoui, N.: Logistic chaotic maps for binary numbers generators. Chaos, Solitons & Fractals (in press) (2007) doi: 10.1016/j.chaos.2007.10.049
6. Deane, J.B., Jefferies, D.J.: Chaotic dynamics and forbidden words. In: Proceedings of the Complex 2000 Conference, pp. 265-273. Dunedin, New Zeeland (2000)
7. Vlad, A., Luca, A., Badea, B.: On statistical independence in the logistic map: a guide to design new chaotic sequences useful in cryptography. In: Gervasi, O., Gavrilova, M.L. (eds.) ICCSA 2007, Part III. LNCS, vol. 4707, pp. 460-474. Springer, Heidelberg (2007)
8. Badea, B., Vlad, A.: Revealing statistical independence of two experimental data sets. An improvement on Spearman's algorithm. In: Gavrilova, M.L., Gervasi, O., Kumar, V., Tan, C.J.K., Taniar, D., Laganá, A., Mun, Y., Choo, H. (eds.) ICCSA 2006. LNCS, vol. 3980, pp. 1166-1176. Springer, Heidelberg (2006)
9. Luca, A., Vlad, A.: Generating Identically and Independently Distributed Samples Starting from Chaotic Signals. In: Proc. IEEE Int. Symposium on Signals, Circuits and Systems (ISSCS 2005), pp. 227-230. Iasi, Romania (2005)
10. Lasota, A., Mackey, M.C.: Chaos, Fractals, and Noise. Stochastic Aspects of Dynamics, 2nd edn. Springer, New York (1994)
11. Kennedy, M.P., Rovatti, R., Setti, G.: Chaotic Electronics in Telecommunications. CRC Press, Boca Raton (2000)