2D arcsine and sine combined logistic map for image encryption

Chaotic system is widely applied in field of information security because of its excellent properties of unpredictability, no periodicity, pseudo-randomness, and high sensitivity to initial parameters. In this paper, we propose a new chaotic map, named 2D arcsine and sine combined logistic map (2D-A...

Full description

Saved in:
Bibliographic Details
Published in:The Visual computer Vol. 39; no. 4; pp. 1517 - 1532
Main Authors: Ding, Yi, Duan, Zhikui, Li, Shiren
Format: Journal Article
Language:English
Published: Berlin/Heidelberg Springer Berlin Heidelberg 01.04.2023
Springer Nature B.V
Subjects:
Algorithms
Artificial Intelligence
Chaos theory
Computer Graphics
Computer Science
Cryptography
Data encryption
Dynamical systems
Encryption
Image Processing and Computer Vision
Multimedia
Original Article
Parameter sensitivity
Randomness
Security
Chaotic mapping
Image encryption algorithm
A chaotic tree transform
2D arcsine and sine combined logistic mapping
ISSN:0178-2789, 1432-2315
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Chaotic system is widely applied in field of information security because of its excellent properties of unpredictability, no periodicity, pseudo-randomness, and high sensitivity to initial parameters. In this paper, we propose a new chaotic map, named 2D arcsine and sine combined logistic map (2D-ASLM), which is a combination of arcsine, Sine, and Logistic maps. Compared with the existing chaotic maps, the proposed one has the better pseudo-randomness and ergodicity from the viewpoint of chaotic performance. Besides, it also has a more unpredictable chaotic rang as well as a relatively low implementation cost. A chaotic tree transform (CTT) is introduced to effectively disrupt the image pixel positions. Then, the image can be encrypted by combining 2D-ASLM and CTT. Extensive results on encryption simulation and security analysis have shown the effectiveness of the proposed algorithm from different aspects.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:0178-2789
1432-2315
DOI:10.1007/s00371-022-02426-0