Comparative Study of 1-D Chaotic Generators for Digital Data Encryption

The security of transmitted digital information through a channel, against passive or active attacks, becomes more and more important. The use of a 1-D chaotic signal to mask useful information and to make it unrecognizable by an eavesdropper is a field of research in full expansi on. In order to obtain such high-level security; chaotic generat ors used to encrypt digital data, must have desirable dynamical statistical properties such as: noise-like autocorr elation, cross-correlation, uniformity, attractors, etc. In this paper; first, we design, improve and simulate using Matlab some 1-D chaotic generators: Logistic map, PWLCM (PieceWise Linear Chaotic Map) map, Perturbed PWLCM map, Frey map, perturbed Frey map, (n, t)-tailed shifts map a nd perturbed one. Second, we show the importance of perturbed chaotic orbit with a comparative study of the dynamical statistical properties obtained under simulation an d Nist tests.