.png){kind=icon}
.png){kind=icon}
Return
A probabilistic image encryption algorithm based on Huffman coding
.png){kind=icon}
PRE
AI
DOI：10.1016/j.jfranklin.2026.108656.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
Most existing image encryption algorithms are deterministic: given a secret key and a plain image, the encryption process invariably produces a unique cipher image, regardless of when the encryption is performed. This property creates potential vulnerabilities to known/chosen plaintext attacks. To address this issue, this paper proposes a probabilistic image encryption algorithm based on Huffman coding. A combinatorial chaotic map is employed to generate a cryptographically secure pseudo-random sequence, which serves as an equivalent key. The plain image is first compressed using Huffman coding; then, a computer-generated ancillary pseudo-random sequence is adaptively embedded into the compressed data. Subsequently, an adaptive confusion step followed by a four-channel lifting-like transform diffusion process is applied to produce the final cipher image. Simulation results demonstrate that the proposed algorithm yields favorable statistical properties for the cipher image and exhibits strong system sensitivity—particularly, the embedded ancillary sequence contributes significantly to the probabilistic nature and security of the scheme. Consequently, the algorithm is well suited for information-security applications with stringent protection requirements.
Keywords:
probabilistic encryption
Huffman coding
chaotic map
image encryption
pseudo-random sequence
Journal
J
IF:
4.2
Papers:
822
Citations:
0