![pseudo random generator algorithm pseudo random generator algorithm](https://www.firstpr.com.au/dsp/rand31/rand31-park-miller-carta-souce-dsPIC-no-comments.png)
Although they can obtain high-performance pseudo-random sequences, they also have some problems such as computational complexity and low utilization because of multiple chaotic iterations. Both of these two algorithms used multiple chaotic iterations to generate pseudo-random numbers. Han proposed an algorithm to generate the pseudo-random number based on the discrete chaotic synchronization system, and Dong proposed an algorithm to generate the pseudo-random number based on the cellular neural networks (CNNs). Bo proposed a random sequence algorithm based on knight cruising, which can achieve good randomness, but the knight cruising path is complex. Some other methods such as shift registered sequence generator and compound prime number generator also have weak random performance.
![pseudo random generator algorithm pseudo random generator algorithm](http://what-when-how.com/wp-content/uploads/2011/06/tmp18279_thumb222.png)
Because of the generation circle of the pseudo-random number depends on the initial values, the statistical performance of these pseudo-random numbers is not perfect. At present, some common algorithms such as taking the middle number or the congruence method. Studying the algorithm which can generate a random number with high randomness is becoming an important topic of information security. The random number has an important effect on data encryption, network information security, image communication, and satellite navigation.