.png){kind=icon}
.png){kind=icon}
Return
Cryptanalysis on a permutation-rewriting- diffusion (PRD) structure image encryption scheme
.png){kind=icon}
PRE
AI
DOI：10.1007/s11042-022-12515-w.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Recently, an efficient pixel-level chaotic image encryption algorithm has been proposed. In this encryption algorithm, they adopted a permutation-rewriting-diffusion (PRD) encryption structure, which enhanced the relationship between permutation and diffusion. At the same time, the generation of the keystream is related to the pixels square sum of the plaintext image. However, there are still two security risks in their encryption scheme. First, both the rewriting and the diffusion operations are performed by modular addition, which makes the two operations equivalent to one-step diffusion operation. Second, the rewriting parameters and the diffusion matrix are both independent of the plaintext. Therefore, the rewriting-diffusion process can be represented by an equivalent modular addition formula, and the PRD structure is equal to the classic PD structure. The separate attack method is used in this paper to crack the encryption scheme. At first, the equivalent diffusion process is cracked by performing the modulo subtraction operation on the target deciphered image and the cipher-text of an all-zero image. Then, the permutation rule is deciphered by constructing several images with the same square sum of pixels. In addition, some improvements for Ye' s encryption scheme are provided to enhance the security.
Keywords:
Cryptanalysis
Chosen-plaintext attack
Chaotic system
PRD structure
Journal
IF:
3
Papers:
1.9W
Citations:
3.2W