scispace - formally typeset
Search or ask a question
Author

Nanrun Zhou

Bio: Nanrun Zhou is an academic researcher from Nanchang University. The author has contributed to research in topics: Encryption & Key space. The author has an hindex of 36, co-authored 136 publications receiving 4100 citations. Previous affiliations of Nanrun Zhou include Nanchang Hangkong University & University of Pittsburgh.


Papers
More filters
Journal ArticleDOI
TL;DR: The proposed cryptosystem decreases the volume of data to be transmitted and simplifies the keys distribution simultaneously as a nonlinear encryption system with acceptable compression and security performance.
Abstract: Most image encryption algorithms based on low-dimensional chaos systems bear security risks and suffer encryption data expansion when adopting nonlinear transformation directly. To overcome these weaknesses and reduce the possible transmission burden, an efficient image compression–encryption scheme based on hyper-chaotic system and 2D compressive sensing is proposed. The original image is measured by the measurement matrices in two directions to achieve compression and encryption simultaneously, and then the resulting image is re-encrypted by the cycle shift operation controlled by a hyper-chaotic system. Cycle shift operation can change the values of the pixels efficiently. The proposed cryptosystem decreases the volume of data to be transmitted and simplifies the keys distribution simultaneously as a nonlinear encryption system. Simulation results verify the validity and the reliability of the proposed algorithm with acceptable compression and security performance.

311 citations

Journal ArticleDOI
TL;DR: A new image compression–encryption hybrid algorithm is proposed to realize compression and encryption simultaneously, where the key is easily distributed, stored or memorized.
Abstract: The existing ways to encrypt images based on compressive sensing usually treat the whole measurement matrix as the key, which renders the key too large to distribute and memorize or store. To solve this problem, a new image compression–encryption hybrid algorithm is proposed to realize compression and encryption simultaneously, where the key is easily distributed, stored or memorized. The input image is divided into 4 blocks to compress and encrypt, then the pixels of the two adjacent blocks are exchanged randomly by random matrices. The measurement matrices in compressive sensing are constructed by utilizing the circulant matrices and controlling the original row vectors of the circulant matrices with logistic map. And the random matrices used in random pixel exchanging are bound with the measurement matrices. Simulation results verify the effectiveness, security of the proposed algorithm and the acceptable compression performance.

282 citations

Journal ArticleDOI
TL;DR: A novel image compression–encryption scheme is proposed by combining 2D compressive sensing with nonlinear fractional Mellin transform to achieve compression and encryption simultaneously.

234 citations

Journal ArticleDOI
TL;DR: Numerical simulations demonstrate that the proposed novel nonlinear image encryption scheme is robust with noise immunity, sensitive to the keys, and outperforms the conventional linear encryption methods to counteract some attacks.

213 citations

Journal ArticleDOI
TL;DR: Numerical simulations and theoretical analyses demonstrate that the proposed quantum image encryption algorithm with good feasibility and effectiveness has lower computational complexity than its classical counterpart.
Abstract: A quantum realization of the generalized Arnold transform is designed. A novel quantum image encryption algorithm based on generalized Arnold transform and double random-phase encoding is proposed. The pixels are scrambled by the generalized Arnold transform, and the gray-level information of images is encoded by the double random-phase operations. The keys of the encryption algorithm include the independent parameters of coefficients matrix, iterative times and classical binary sequences, and thus, the key space is extremely large. Numerical simulations and theoretical analyses demonstrate that the proposed algorithm with good feasibility and effectiveness has lower computational complexity than its classical counterpart.

194 citations


Cited by
More filters
01 Jun 2005

3,154 citations

Journal ArticleDOI
TL;DR: A cosine-transform-based chaotic system (CTBCS) that can produce chaotic maps with complex dynamical behaviors and an image encryption scheme that provides a higher level of security than several advanced image encryption schemes.

463 citations

Journal ArticleDOI
Lu Xu1, Zhi Li1, Jian Li1, Wei Hua1
TL;DR: A novel bit-level image encryption algorithm that is based on piecewise linear chaotic maps (PWLCM) that is both secure and reliable for image encryption.

449 citations

Journal ArticleDOI
TL;DR: A two-dimensional (2D) Logistic-Sine-coupling map (LSCM) is presented and performance estimations demonstrate that it has better ergodicity, more complex behavior and larger chaotic range than several newly developed 2D chaotic maps.

383 citations