N ‐phase logistic chaotic sequence and its application for image encryption. Issue 9 (1st December 2016)

• Record Type: Journal Article
• Authors: Liu, Lingfeng; Miao, Suoxia; Hu, Hanping; Cheng, Mengfan
• Is Part Of: IET signal processing. Volume 10:Issue 9(2016)
• Page Start: 1096
• Page End: 1104
• Publication Date: 2016-12-01
• Subjects: image processing -- cryptography -- chaos -- computational complexity -- statistical distributions -- random sequences -- polynomials; image encryption algorithms -- N‐phase logistic chaotic sequence -- N‐phase pseudorandom sequence generation -- uniform distribution -- time complexity -- shuffling algorithm -- substitution algorithm -- security tests -- security level -- logistic maps; Signal processing -- Periodicals; 621.3822
• DOI: 10.1049/iet-spr.2015.0522
• Languages: English
• ISSNs: 1751-9675

Abstract

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.