TY - JOUR
T1 - A new image encryption using color scrambling based on chaotic permutation multiple circular shrinking and expanding
AU - Suryanto, Yohan
AU - Suryadi, null
AU - Ramli, Kalamullah
N1 - Publisher Copyright:
© 2016, Springer Science+Business Media New York.
PY - 2017/8/1
Y1 - 2017/8/1
N2 - In this paper, we propose a new color image encryption method using color scrambling based on the chaotic permutation multiple circular shrinking and expanding (CPMCS/ CPMCE). The plain color image with a size of m x n x 3 is arranged in two-dimensional array, where each row consists of the Red, Green, and Blue (RGB) component, forming two-dimensional array with a size of m x 3n. The arranged 2D array then permuted by CPMCS for the each row and column. To reconstruct the original image, the ciphered image is arranged in 2D array then is permuted by CPMCE for each column and row. The proposed method is characterized by very high key space that reaches 22,895,713 for an image size of 256x256, so that resistance to brute force attack and can anticipate the emergence of quantum computers. It also resistant to a differential attack due to change a single bit in the plain image causes a significant change in the ciphered image. The proposed encryption also yield completely difference ciphered image series from the same plain image just using arbitrary increment sequence key. It is also robust to JPEG compression so the ciphered image can be stored in smaller size, such as for the ciphered Lena image only needs 1/5.2 of the original one when compressed using JPEG 70 %. It also resistant to noise scheme (Gaussian, Poisson, Salt&Pepper, and spekle), data loss, and brightness-contrast adjustment, so the ciphered image can be transmitted in a non error free communication system.
AB - In this paper, we propose a new color image encryption method using color scrambling based on the chaotic permutation multiple circular shrinking and expanding (CPMCS/ CPMCE). The plain color image with a size of m x n x 3 is arranged in two-dimensional array, where each row consists of the Red, Green, and Blue (RGB) component, forming two-dimensional array with a size of m x 3n. The arranged 2D array then permuted by CPMCS for the each row and column. To reconstruct the original image, the ciphered image is arranged in 2D array then is permuted by CPMCE for each column and row. The proposed method is characterized by very high key space that reaches 22,895,713 for an image size of 256x256, so that resistance to brute force attack and can anticipate the emergence of quantum computers. It also resistant to a differential attack due to change a single bit in the plain image causes a significant change in the ciphered image. The proposed encryption also yield completely difference ciphered image series from the same plain image just using arbitrary increment sequence key. It is also robust to JPEG compression so the ciphered image can be stored in smaller size, such as for the ciphered Lena image only needs 1/5.2 of the original one when compressed using JPEG 70 %. It also resistant to noise scheme (Gaussian, Poisson, Salt&Pepper, and spekle), data loss, and brightness-contrast adjustment, so the ciphered image can be transmitted in a non error free communication system.
KW - Chaotic permutation
KW - Circular shrinking and expanding
KW - Color image encryption
KW - Image series
KW - Robust to noise
KW - Very large key space
UR - http://www.scopus.com/inward/record.url?scp=84989834424&partnerID=8YFLogxK
U2 - 10.1007/s11042-016-3954-5
DO - 10.1007/s11042-016-3954-5
M3 - Article
AN - SCOPUS:84989834424
SN - 1380-7501
VL - 76
SP - 16831
EP - 16854
JO - Multimedia Tools and Applications
JF - Multimedia Tools and Applications
IS - 15
ER -