A parallel image encryption algorithm using intra bitplane scrambling
More and more privacy-sensitive images have been produced daily. Chaotic encryption guarantees that only the targeted receiver can obtain the raw image. Many works perform encryption on bit-level for better permutation but incur an unbearable time consumption caused by generating additional 3D coord...
Saved in:
| Published in: | Mathematics and computers in simulation Vol. 204; pp. 71 - 88 |
|---|---|
| Main Authors: | , , , , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier B.V
01.02.2023
|
| Subjects: | |
| ISSN: | 0378-4754, 1872-7166 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | More and more privacy-sensitive images have been produced daily. Chaotic encryption guarantees that only the targeted receiver can obtain the raw image. Many works perform encryption on bit-level for better permutation but incur an unbearable time consumption caused by generating additional 3D coordinates. High-dimensional chaotic system, suitable for encrypting images, needs to iterate repeatedly for several rounds, resulting in low encrypting efficiency. This paper proposes a parallel image encryption algorithm using intra bitplane scrambling. Four threads are utilized to encrypt the images in bit-level during the permutation, where each thread scrambles two bitplanes. In diffusion, we build multiple threads to generate keystream segments to reduce encryption time. We make cryptographic analyses and compare the encryption speed with the advanced works, demonstrating that our scheme is secure and efficient.
•The proposed parallel bit-level permutation algorithm offers a good trade-off between efficiency and effect.•To accelerate the keystreams generation in diffusion stage, multi-threading technology is used to generate them in parallel.•The results of security analyses show the proposed algorithm has high efficiency compared with other state-of-the-art algorithms. |
|---|---|
| ISSN: | 0378-4754 1872-7166 |
| DOI: | 10.1016/j.matcom.2022.07.029 |