Fast and Secure Image Encryption Algorithm with Simultaneous Shuffling and Diffusion Based on a Time-Delayed Combinatorial Hyperchaos Map

Adding time delay to nonlinear systems can significantly improve their performance, making it possible to construct image-encryption algorithms with higher security. In this paper, we propose a time-delayed nonlinear combinatorial hyperchaotic map (TD-NCHM) with a wide hyperchaotic interval. Based o...

Full description

Saved in:
Bibliographic Details
Published in:Entropy (Basel, Switzerland) Vol. 25; no. 5; p. 753
Main Authors: Shen, Yulin, Huang, Jun, Chen, Lingling, Wen, Tao, Li, Tangyan, Zhang, Guidong
Format: Journal Article
Language:English
Published: Switzerland MDPI AG 05.05.2023
MDPI
Subjects:
Algorithms
Combinatorial analysis
Data encryption
Diffusion rate
Efficiency
fast image-encryption algorithm
Multimedia
Nonlinear systems
Security
Security management
simultaneous shuffling and diffusion
Time lag
time-delayed hyperchaotic map
fast image-encryption algorithm
simultaneous shuffling and diffusion
time-delayed hyperchaotic map
ISSN:1099-4300, 1099-4300
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Adding time delay to nonlinear systems can significantly improve their performance, making it possible to construct image-encryption algorithms with higher security. In this paper, we propose a time-delayed nonlinear combinatorial hyperchaotic map (TD-NCHM) with a wide hyperchaotic interval. Based on TD-NCHM, we develop a fast and secure image-encryption algorithm that includes a plaintext-sensitive key-generation method and a simultaneous row-column shuffling-diffusion encryption process. Plenty of experiments and simulations demonstrate the superiority of the algorithm in terms of efficiency, security, and practical value in secure communications.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
content type line 23
These authors contributed equally to this work.
ISSN:1099-4300
1099-4300
DOI:10.3390/e25050753