An Improved Image Multi-Dimensional Chaos Encryption Algorithm Based on CUDA

He, Gang; Wu, Wenqing; Wen, Jun; Yang, Cheng Hsiung; Yu, Wenxin

doi:10.1109/icist.2019.8836920

Cited by 6 publications

(6 citation statements)

References 32 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The high-dimensional hyperchaotic system has a more complex structure than the low-dimensional chaotic system, and the randomness of the generated sequence is stronger, which is more suitable for image encryption [ 33 ]. The 4D multi-character system (MCS) is defined by [ 34 ].…”

Section: Fundamental Knowledge and Related Technologiesmentioning

confidence: 99%

Visual Secure Image Encryption Scheme Based on Compressed Sensing and Regional Energy

Shi

Guo

Song

et al. 2021

Entropy

View full text Add to dashboard Cite

The network security transmission of digital images needs to solve the dual security problems of content and appearance. In this paper, a visually secure image compression and encryption scheme is proposed by combining compressed sensing (CS) and regional energy. The plain image is compressed and encrypted into a secret image by CS and zigzag confusion. Then, according to the regional energy, the secret image is embedded into a carrier image to obtain the final visual secure cipher image. A method of hour hand printing (HHP) scrambling is proposed to increase the pixel irrelevance. Regional energy embedding reduce the damage to the visual quality of carrier image, and the different embedding positions between images greatly enhances the security of the encryption algorithm. Furthermore, the hyperchaotic multi-character system (MCS) is utilized to construct measurement matrix and control pixels. Simulation results and security analyses demonstrate the effectiveness, security and robustness of the propose algorithm.

show abstract

Section: Fundamental Knowledge and Related Technologiesmentioning

confidence: 99%

Visual Secure Image Encryption Scheme Based on Compressed Sensing and Regional Energy

Shi

Guo

Song

et al. 2021

Entropy

View full text Add to dashboard Cite

show abstract

“…If the cryptosystem's emerging applications are the immediate causes, its features are indirect causes. Realtime [5,9], high-protective [5,10,11], remote sensing [12], computer vision [13], deep learning [14], super-resolution [15,16], and multimedia [17] applications are important indirect causes. Transmission cost [18], hardware cost, and the power consumption [19,20], is an example of an indirect cause.…”

Section: Background and Motivationmentioning

confidence: 99%

“…Transmission cost [18], hardware cost, and the power consumption [19,20], is an example of an indirect cause. The use of multi-type maps [21], the size of the images, and some redundancy [5] can also help with efficiency through parallelism. Hines [1] Original image transformed to a scrambled image and later restored using same code plates.…”

Section: Background and Motivationmentioning

confidence: 99%

“…He et al [5] Proposed parallel twodimensional Arnold chaotic map for pixel shuffling and threedimensional Liu map system for the encryption.…”

Section: High Securitymentioning

confidence: 99%

“…Other than the pixel correlation in two-dimensional space, images have characteristics of high-capacity and redundancy of computations. Due to these two features, the logistic map based encryption is not affordable for on-line communications and real-time applications [5]. The last decade has witnessed an exponential growth in parallel processing power and paradigms [6].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

An Accelerator-based Logistic Map Image Cryptosystems for Grayscale Images

Holla

Pais

Suma

2021

JCSANDM

View full text Add to dashboard Cite

The logistic map is a class of chaotic maps. It is still in use in image cryptography. The logistic map cryptosystem has two stages, namely permutation, and diffusion. These two stages being computationally intensive, the permutation relocates the pixels, whereas the diffusion rescales them. The research on refining the logistic map is progressing to make the encryption more secure. Now there is a need to improve its efficiency to enable such models to fit for high-speed applications. The new invention of accelerators offers efficiency. But the inherent data dependencies hinder the use of accelerators. This paper discusses the novelty of identifying independent data-parallel tasks in a logistic map, handing them over to the accelerators, and improving their efficiency. Among the two accelerator models proposed, the first one achieves peak efficiency using coalesced memory access. The other cryptosystem further improves performance at the cost of more execution resources. In this investigation, it is noteworthy that the parallelly accelerated logistic map achieved a significant speedup to the larger grayscale image used. The objective security estimates proved that the two stages of the proposed systems progressively ensure security.

show abstract