scispace - formally typeset
N

Nanrun Zhou

Researcher at Nanchang University

Publications -  150
Citations -  5875

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

An optical image compression and encryption scheme based on compressive sensing and RSA algorithm

TL;DR: Experimental results demonstrate the effectiveness and reliability of the proposed optical image compression and encryption scheme with considerable compression and security performance.
Journal ArticleDOI

Novel image encryption algorithm based on multiple-parameter discrete fractional random transform

TL;DR: The computer simulation results show that the proposed encryption algorithm is sensitive to the multiple keys, and that it has considerable robustness, noise immunity and security.
Journal ArticleDOI

Bit-level quantum color image encryption scheme with quantum cross-exchange operation and hyper-chaotic system

TL;DR: Simulations and theoretical analyses demonstrate that the presented bit-level quantum color image encryption scheme outperforms its classical counterparts in efficiency and security.
Journal ArticleDOI

Multi-image encryption scheme based on quantum 3D Arnold transform and scaled Zhongtang chaotic system

TL;DR: Numerical simulations and theoretical analyses demonstrate that the proposed quantum multi-image encryption scheme outperforms both its classical counterparts and the existing typical quantum image encryption algorithms in terms of security, robustness, encryption capacity and computational complexity.
Journal ArticleDOI

Multi‐Party Semi‐Quantum Key Distribution Protocol With Four‐Particle Cluster States

TL;DR: A semi‐quantum key distribution protocol based on four‐particle cluster states is put forward, which can achieve key distribution among one quantum party and two classical parties simultaneously, and can be expanded to the χ‐party ( χ>3 ) communication scheme.