The paper explores the possibility to generate experimental independent and identically distributed data sets starting from the logistic map and discusses its applicability in cryptography. In order to reveal the statistical independence in the context of a chaotic signal, and to come up with firm and accurate results, the paper combines usual statistical methods with an original test procedure useful in the case of continuous random variables of unknown probability law. The overall theoretical approach may be viewed as a guide to generate independent and identically distributed samples starting from the logistic map, and also to design chaotic sequences useful for cryptographic purposes. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Vlad, A., Luca, A., & Badea, B. (2007). On statistical independence in the logistic map: A guide to design new chaotic sequences useful in cryptography. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4707 LNCS, pp. 460–474). Springer Verlag. https://doi.org/10.1007/978-3-540-74484-9_40
Mendeley helps you to discover research relevant for your work.