Random sequence generation algorithm for multi-chaotic systems

1Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The characteristics of chaotic signals, such as pseudorandom and non long term predictability, make it suitable for application to information encryption, digital watermarking and so on. Nevertheless, since the chaotic system is often characterized by its characteristics, attackers can take advantage of these known features to reduce the difficulty of attacks. In contrast, the characteristics of multi-chaotic systems are not uniform, and the complexity of generating sequences is higher than that of single-chaos systems. Hence, the multi-chaotic system increases the security of the sequence to some extent. Therefore, we design a random sequence generation algorithm consisting of multiple chaotic systems that is a chaotic sequence generation algorithm combining Logistic map and Cubic map. And we analyze the sequence of new generation whose the performance, so we can conclude that the new algorithm has better randomness.

Cite

CITATION STYLE

APA

Chen, X., & Wu, H. (2018). Random sequence generation algorithm for multi-chaotic systems. In Lecture Notes of the Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering, LNICST (Vol. 251, pp. 136–143). Springer Verlag. https://doi.org/10.1007/978-3-030-00557-3_14

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free