Source-linked AI summary
Cryptanalyzing an image encryption algorithm based on autoblocking and electrocardiography
Chengqing Li, Dongdong Lin, Jinhu Lü, Feng Hao
TL;DR
The paper examines whether Ye and Huang’s ECG-based autoblocking image-encryption algorithm withstands modern cryptanalytic analysis. It analyzes the scheme’s construction and security defects, finding that one known plaintext–ciphertext pair can enable decryption of other ciphertexts under stated conditions. The paper uses this vulnerability as a counterexample to identify broader design pitfalls in image encryption schemes.
Problem
The paper addresses whether IEAE, claimed to resist known-plaintext and chosen-plaintext attacks, provides adequate security under modern cryptographic analysis.
Method
The paper performs a security analysis of IEAE, examining its ECG-derived chaotic initialization, autoblocking, encryption structure, and cryptanalytic weaknesses.
Results
IEAE is very weak against known-plaintext attack, with one known plaintext–ciphertext pair yielding a mask image usable as an equivalent secret key under stated conditions.
Takeaways & Limitations
The analysis summarizes security defects in IEAE to inform the design and security improvement of image encryption schemes.
Takeaways & Limitations
IEAE’s practicality is constrained by dependence on time-series length, parameter selection, computational procedures, and consistent numerical configurations across setups.
Abstract
from arXiv · showhide
This paper analyzes the security of an image encryption algorithm proposed by Ye and Huang [\textit{IEEE MultiMedia}, vol. 23, pp. 64-71, 2016]. The Ye-Huang algorithm uses electrocardiography (ECG) signals to generate the initial key for a chaotic system and applies an autoblocking method to divide a plain image into blocks of certain sizes suitable for subsequent encryption. The designers claimed that the proposed algorithm is "strong and flexible enough for practical applications". In this paper, we perform a thorough analysis of their algorithm from the view point of modern cryptography. We find it is vulnerable to the known plaintext attack: based on one pair of a known plain-image and its corresponding cipher-image, an adversary is able to derive a mask image, which can be used as an equivalent secret key to successfully decrypt other cipher-images encrypted under the same key with a non-negligible probability of 1/256. Using this as a typical counterexample, we summarize security defects in the design of the Ye-Huang algorithm. The lessons are generally applicable to many other image encryption schemes.
1. Introduction
The introduction motivates image encryption through growing privacy concerns and the security appeal of chaotic dynamics, then positions IEAE as an ECG-based improvement whose security is reevaluated here.
- Image encryption schemes aim to conceal important information in original image data from unintended viewers.
- Chaotic maps attract security researchers because their complex dynamics resemble properties associated with secure encryption systems.
- ECG signals have been used for identification, secure communication, authentication, and cryptographic key generation.
- Earlier ECG-chaos schemes faced concerns about weak map selection, digital-domain degeneration, and unspecified diffusion and confusion functions.
- Ye and Huang proposed IEAE to improve an earlier ECG-based scheme by using ECG-generated initial keys to control block-wise matrix multiplications.
2. Image encryption algorithm based on autoblocking and electrocardiography (IEAE)
IEAE generates chaotic sequences from an ECG-derived Lyapunov exponent and encrypts automatically selected image blocks through repeated modular operations involving diffusion and chaining.
- IEAE encrypts a gray-scale image I of size M × N and divides the whole plain image into p1 × p2 blocks for blockwise encryption.
- The secret key includes non-negative array indexes ω1, ω2, µ1, µ2 and the Logistic-map control parameter µ, while iteration number R is public.
- The largest Lyapunov exponent λ is calculated from an ECG signal using Wolf’s algorithm before generating the encryption sequences.
- The algorithm estimates λ through phase-space evolution and replacement steps that continue until the evolving time index exceeds L*.
- The Logistic map produces an integer sequence, while a second iteration generates sequence values assigned to an M × N matrix D and an initial block matrix C0.
- Block dimensions are selected from a fixed lookup table via random entries; zero pixels are padded when dimensions do not divide M or N.
- Each block is encrypted repeatedly using Ck = (Ik + v · Dk + Ck−1) mod 256, with decryption defined as the inverse operation.
3. Cryptanalysis of IEAE
The analysis shows that IEAE is vulnerable to a known-plaintext attack and exhibits multiple security defects in its digital chaotic maps, evaluation metrics, and efficiency claims.
- Known-plaintext attack: The attack challenges IEAE’s claim that plaintext-related keystreams resist all differential attacks.The paper identifies this claim as false and uses IEAE to expose mechanisms underlying insecurity in related image-encryption schemes.
- Known-plaintext attack: A known-plaintext attacker can derive a mask image that functions as an equivalent IEAE key under stated reuse and parameter conditions.The attack applies when the target ciphertext uses the same secret key and public parameter, and its plaintext generates the same µ3 value.
- Real structure of digital chaotic maps: Finite-precision implementations degrade chaotic-map dynamics, while Lyapunov exponents can omit short-period cycles and other functional-graph properties.The paper illustrates this issue with Logistic-map functional graphs under fixed-point quantization and notes that small connected components may be omitted.
- Period behavior of the generalized Arnold map: The generalized Arnold map’s positive Lyapunov exponent does not establish random behavior: one depicted graph contains connected components with periods 16, 8, 4, and 2, plus self-connected nodes.The paper therefore describes the claimed support for random behavior as groundless because it represents only a short orbit in a digital connected component.
- Incapability of the test metrics adopted by IEAE: IEAE’s histogram and correlation tests are insufficient security evidence because bit histograms can reveal plaintext statistics and low adjacent-pixel correlation is only necessary.Position permutation alone can reduce neighboring-pixel correlation, so the metric does not establish resistance to broader attacks.
- Low efficiency of the method generating PRNS: IEAE’s speed is attributed to a simple linear encryption function, while substantial computation is spent generating pseudorandom sequences and may vary with Lyapunov-exponent estimation settings.For m = 14, the analyzed computations use only eight and two least significant bits despite computing more bits, so much of the work is wasted.
4. Conclusion
The paper finds that the analyzed image encryption algorithm is very weak against known-plaintext attacks and summarizes its security defects to guide future image-encryption design.
- The analyzed image encryption algorithm was shown to be very weak against the known-plaintext attack.
- The paper summarizes security defects in the algorithm to identify common pitfalls in image-encryption schemes.
- These lessons are intended to help designers improve the security of image data protection.