Loading…

A novel batch image encryption algorithm using parallel computing

Chaos-based encryption provides a practical way to protect the confidentiality of digital images nowadays. The increasing convenience (e.g., larger bandwidth) of data sharing stimulates the need for encrypting amounts of images in a fast manner. Yet most existing works aim to encrypt an image for ea...

Full description

Saved in:
Bibliographic Details
Published in:Information sciences 2020-05, Vol.518, p.211-224
Main Authors: Song, Wei, Zheng, Yu, Fu, Chong, Shan, Pufang
Format: Article
Language:English
Subjects:
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Chaos-based encryption provides a practical way to protect the confidentiality of digital images nowadays. The increasing convenience (e.g., larger bandwidth) of data sharing stimulates the need for encrypting amounts of images in a fast manner. Yet most existing works aim to encrypt an image for each time. Although some parallel encryptions have been proposed, the speed is still far from satisfactory to proceed with the huge increasing number of images. This inspires us to consider another promising way, encrypting a batch of images parallelly for each time. We use maximum available number of threads in parallel computation for full use of processor resources. Considering the batch images as a shared resource, every thread competes with others to encrypt images in the shared resource in a preemptive manner for encryption. A classical permutation-diffusion architecture for chaos-based encryption is utilized for each thread, where logistic map and Lorenz system are used for generating keystream for permutation and diffusion, respectively. We make cryptographical analyses and perform experiments to confirm that the security is guaranteed. The results of efficiency tests demonstrate that the encryption speed is greatly improved compared with the state-of-art image encryption algorithms in parallel as well as serial modes.
ISSN:0020-0255
1872-6291
DOI:10.1016/j.ins.2020.01.009