Name
Abstract | ||
|---|---|---|
In this study, the authors use a non-symmetric partition to generate N-phase pseudorandom sequences using the logistic maps. The theoretical analysis shows that this N-phase logistic sequence is with uniform distribution, as well as independent and identically distributed. Numerical experiments show that these N-phase logistic sequences have high complexity and are with good randomness. A fast algorithm with its time complexity be O(M) is proposed to generate these N-phase sequences. Furthermore, they propose a new image encryption algorithm based on the N-phase logistic sequence, which is combined with both shuffling and substitution algorithms. Several security tests are carried out to demonstrate that the authors’ new algorithm is with a high security level, and can resist various attacks, which can be competitive with some other recently proposed image encryption algorithms. |
Year | Venue | Field |
|---|---|---|
2016 | IET Signal Processing | Pseudorandom binary sequence,Algorithm,Encryption,Shuffling,Independent and identically distributed random variables,Chaotic,Time complexity,Mathematics,Randomness,Pseudorandom number generator |
DocType | Volume | Issue |
Journal | 10 | 9 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Lingfeng Liu | 1 | 108 | 11.92 |
| Suoxia Miao | 2 | 43 | 5.64 |
| Hanping Hu | 3 | 178 | 18.63 |
| Mengfan Cheng | 4 | 4 | 3.53 |