Source-linked AI summary
Cracking a hierarchical chaotic image encryption algorithm based on permutation
Chengqing Li
TL;DR
The paper examines whether HCIE, a hierarchical permutation-only image encryption algorithm, provides the security claimed for it. It analyzes ciphertext-only and known/chosen-plaintext attacks, finding that HCIE is weaker than non-hierarchical permutation-only encryption and that its ciphertext-only security was overestimated.
Problem
HCIE’s specific security against ciphertext-only and known/chosen-plaintext attacks had not been evaluated despite claims of robustness.
Method
The paper analyzes HCIE’s hierarchical block and intra-block permutations through cryptanalysis and experiments, assuming fixed public parameters for known-plaintext analysis.
Results
HCIE is less secure than non-hierarchical permutation-only encryption, while its capability against ciphertext-only attack was much overestimated.
Takeaways & Limitations
The paper concludes that permutation-only encryption should use as large a real permutation domain as possible and be combined with value substitution.
Takeaways & Limitations
The known-plaintext analysis assumes that HCIE’s public parameters remain fixed across all known plain-images.
Abstract
from arXiv · showhide
In year 2000, an efficient hierarchical chaotic image encryption (HCIE) algorithm was proposed, which divides a plain-image of size $M\times N$ with $T$ possible value levels into $K$ blocks of the same size and then operates position permutation on two levels: intra-block and inter-block. As a typical position permutation-only encryption algorithm, it has received intensive attention. The present paper analyzes specific security performance of HCIE against ciphertext-only attack and known/chosen-plaintext attack. It is found that only $O(\lceil\log_T(M\cdot N/K) \rceil)$ known/chosen plain-images are sufficient to achieve a good performance, and the computational complexity is $O(M\cdot N\cdot \lceil\log_T(M\cdot N/K) \rceil)$, which effectively demonstrates that hierarchical permutation-only image encryption algorithms are less secure than normal (i.e., non-hierarchical) ones. Detailed experiment results are given to verify the feasibility of the known-plaintext attack. In addition, it is pointed out that the security of HCIE against ciphertext-only attack was much overestimated.
1. Introduction
The paper frames HCIE as a hierarchical permutation-only image encryption algorithm whose security against plaintext attacks had not been specifically evaluated. It challenges the claim that HCIE is robust, arguing that its hierarchy weakens security and that ciphertext-only security was overestimated.
- Permutation-only encryption protects multimedia data by permuting spatial pixel or frequency-coefficient positions.
- Earlier analyses established attacks and complexity bounds for general permutation-only encryption, motivating scrutiny of HCIE.
- HCIE is presented as a typical permutation-only image encryption algorithm whose specific security performance remained unevaluated.
- The paper argues that HCIE’s robustness against known/chosen-plaintext attacks is groundless and that its hierarchical structure makes security weaker.
- The paper also reports that HCIE’s capability against ciphertext-only attack was much overestimated.
2. The hierarchical chaotic image encryption algorithm (HCIE)
HCIE performs image permutation hierarchically: it first permutes equal-sized image blocks, then permutes pixels within each resulting block. Its mappings are generated by pseudo-random combinations of four rotation operations controlled by chaotic bits and parameters.
- HCIE is a two-level hierarchical permutation-only algorithm using pseudo-random combinations of four rotation mappings.The mappings operate on an image f of size M × N, with p < min(M, N).
- The four mappings rotate rows, columns, and diagonal pixel sets in specified directions by p pixels.Row rotations are horizontal, column rotations vertical, and diagonal mappings follow the two diagonal orientations.
- The secret key consists of the Logistic-map initial condition x(0) and control parameter µ, while additional structural parameters are public.The public parameters include S_M, S_N, α, β, γ, and n_o.
- High-level encryption: At the high level, HCIE divides the image into S_M × S_N blocks and permutes their positions using a shuffled pseudo-image.
- Low-level encryption: At the low level, HCIE applies the Sub HCIE function separately to every permuted block to produce the cipher-image.
- The hierarchical representation can be converted into an equivalent M × N permutation relationship matrix, while degenerate settings recover ordinary permutation-only encryption.
3. Cryptanalysis of HCIE
The analysis shows that HCIE’s hierarchical permutation structure enables efficient attacks by reducing permutation estimation to smaller block-level problems. Experiments confirm that only two or three known plaintexts can often yield acceptable recovery, while the cipher’s brute-force security was substantially overestimated.
- Ciphertext-only attack: 2^2L possible chaotic bit sequences exist because the L_b generated bits are uniquely determined by only 2L secret-key bits.The secret key consists of the Logistic-map initial condition and control parameter.
- Ciphertext-only attack: Block histograms remain unchanged under HCIE’s permutation process, allowing relative block locations to be estimated from histogram similarities.Natural-image correlations make neighboring blocks’ histograms similar enough to support this attack.
- Known-plaintext attack: The hierarchical known-plaintext attack reconstructs the high-level permutation matrix first, then estimates lower-level permutation relationships and decrypts the target image.Mean values, histograms, or full pixel arrays can represent blocks; mean values reduce complexity in typical cases.
- Known-plaintext attack: O(M·N·⌈log_T(M·N/K)⌉) computation is sufficient for the attack, because hierarchical estimation uses permutation matrices smaller than M×N.The hierarchy reduces the number of known plaintexts needed relative to general permutation-only ciphers.
- Experimental results: The estimated permutation matrix’s average cardinality corresponds well with decryption-error occurrence, linking permutation ambiguity to attack quality and time complexity.Figure 6 compares decryption error ratios with the average cardinality of candidate permutation elements.
- Experimental results: 2 known plaintexts produce acceptable breaking performance for S_M=S_N=32 and S_M=S_N=16, whereas 3 are needed when S_M=S_N=256.The experiments used six 256×256 grayscale images and decrypted the sixth image from the estimated permutation relationships.
4. Conclusion
The study finds that HCIE’s ciphertext-only security was substantially overestimated and that hierarchical permutation-only encryption is less secure than non-hierarchical designs. It further argues that permutation should use the largest possible real domain and be combined with value substitution.
- HCIE’s security against ciphertext-only attack was much overestimated.
- Hierarchical permutation-only image encryption algorithms such as HCIE are less secure than non-hierarchical ones.
- The real permutation domain should be as large as possible to achieve the best performance.
- Permutation alone cannot provide high security and should be combined with value substitution functions.