Related Experiment Video
Updated: Aug 5, 2025

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
Published on: August 30, 2013
Cryptanalysis of an Image Encryption Algorithm Based on Two-Dimensional Hyperchaotic Map
Qinmao Jiang1, Simin Yu1, Qianxue Wang1
1College of Automation, Guangdong University of Technology, Guangzhou 510006, China.
This study reveals security vulnerabilities in a hyperchaotic map-based image encryption algorithm. The proposed cryptanalysis effectively breaks the encryption, demonstrating weaknesses against chosen plaintext attacks.
Area of Science:
- Cryptography
- Computer Science
- Information Security
Background:
- Image encryption algorithms are crucial for data security.
- Hyperchaotic maps offer complex dynamics for cryptographic applications.
- Assessing the security of novel encryption methods is essential.
Purpose of the Study:
- To analyze the security of an image encryption algorithm utilizing a two-dimensional hyperchaotic map.
- To identify and exploit vulnerabilities in the proposed encryption scheme.
- To propose improvements for the identified security loopholes.
Main Methods:
- Cryptanalysis using chosen plaintext attacks.
- Iterative optimization to analyze diffusion properties.
- Theoretical analysis and experimental validation of the attack's efficiency.
Main Results:
- The analyzed image encryption algorithm is vulnerable to chosen plaintext attacks.
- The diffusion process, despite using different keys and feedback, can be equivalent to global diffusion.
- Chaotic sequence generation independent of the plaintext allows for key stream recovery.
Conclusions:
- The security claims of the hyperchaotic map-based image encryption algorithm are unsubstantiated.
- The proposed cryptanalysis demonstrates a significant improvement in cracking efficiency.
- Recommendations for enhancing the algorithm's security are provided.
Related Concept Videos
Convolution: Math, Graphics, and Discrete Signals
To simplify the convolution integral, it is assumed that both the input signal and impulse response are zero for negative time values. The graphical convolution process...
Convolution Properties II
The width property indicates that if the durations of input signals are T1 and T2, then the width of the output response equals the sum of both durations, irrespective of the shapes of the two functions. For instance, convolving two rectangular pulses with durations of 2 seconds and 1 second results in a function with a width of 3 seconds.
The area property asserts that the area under the...
Parallel-axis Theorem
Gauss's Law: Planar Symmetry
Routh-Hurwitz Criterion II
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...
Entropy Change in Reversible Processes
The statement can be further generalized to prove that entropy is a state function. Take a cyclic process between any two points on a p-V diagram.

