Jove
Visualize
Contact Us
JoVE
x logofacebook logolinkedin logoyoutube logo
ABOUT JoVE
OverviewLeadershipBlogJoVE Help Center
AUTHORS
Publishing ProcessEditorial BoardScope & PoliciesPeer ReviewFAQSubmit
LIBRARIANS
TestimonialsSubscriptionsAccessResourcesLibrary Advisory BoardFAQ
RESEARCH
JoVE JournalMethods CollectionsJoVE Encyclopedia of ExperimentsArchive
EDUCATION
JoVE CoreJoVE BusinessJoVE Science EducationJoVE Lab ManualFaculty Resource CenterFaculty Site
Terms & Conditions of Use
Privacy Policy
Policies

Related Concept Videos

Convolution: Math, Graphics, and Discrete Signals01:24

Convolution: Math, Graphics, and Discrete Signals

324
In any LTI (Linear Time-Invariant) system, the convolution of two signals is denoted using a convolution operator, assuming all initial conditions are zero. The convolution integral can be divided into two parts: the zero-input or natural response and the zero-state or forced response, with t0 indicating the initial time.
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...
324
Convolution Properties II01:17

Convolution Properties II

252
The important convolution properties include width, area, differentiation, and integration properties.
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...
252
Parallel-axis Theorem01:06

Parallel-axis Theorem

7.1K
The parallel-axis theorem provides a convenient and quick method of finding the moment of inertia of an object about an axis parallel to the axis passing through its center of mass. Consider a thin rod as an example. There is a striking similarity between the process of finding the moment of inertia of a thin rod about an axis through its middle, where the center of mass lies, and about an axis through its end using the conventional method. In the conventional method, the concept of linear mass...
7.1K
Gauss's Law: Planar Symmetry01:27

Gauss's Law: Planar Symmetry

8.0K
A planar symmetry of charge density is obtained when charges are uniformly spread over a large flat surface. In planar symmetry, all points in a plane parallel to the plane of charge are identical with respect to the charges. Suppose the plane of the charge distribution is the xy-plane, and the electric field at a space point P with coordinates (x, y, z) is to be determined. Since the charge density is the same at all (x, y) - coordinates in the z = 0 plane, by symmetry, the electric field at P...
8.0K
Routh-Hurwitz Criterion II01:19

Routh-Hurwitz Criterion II

319
In the application of the Routh-Hurwitz criterion, two specific scenarios can arise that complicate stability analysis.
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...
319
Entropy Change in Reversible Processes01:10

Entropy Change in Reversible Processes

2.6K
In the Carnot engine, which achieves the maximum efficiency between two reservoirs of fixed temperatures, the total change in entropy is zero. The observation can be generalized by considering any reversible cyclic process consisting of many Carnot cycles. Thus, it can be stated that the total entropy change of any ideal reversible cycle is zero.
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.
2.6K

You might also read

Related Articles

Articles linked to this work by shared authors, journal, and citation graph.

Sort by
Same author

A Novel Chaotic Image Encryption Scheme Armed with Global Dynamic Selection.

Entropy (Basel, Switzerland)·2023
Same author

Security Analysis of the Image Encryption Algorithm Based on a Two-Dimensional Infinite Collapse Map.

Entropy (Basel, Switzerland)·2022
Same journal

Research on a Regional Availability Evaluation Model for Road-Area High-Entropy Energy Based on Synergy Factors.

Entropy (Basel, Switzerland)·2026
Same journal

Atmospheric Turbulence Channel Modeling and Performance Analysis of a CO-ZP-OFDM Coherent Optical Communication System for UAV Air-to-Ground Scenarios.

Entropy (Basel, Switzerland)·2026
Same journal

Information Geometry and Asymptotic Theory for SMML Estimators.

Entropy (Basel, Switzerland)·2026
Same journal

Correlation Entropy and Power-Law Kinetics.

Entropy (Basel, Switzerland)·2026
Same journal

Research on the Contagion of Systemic Financial Risk Under the Impact of Climate Risks-From the Perspective of Complex Networks and Machine Learning.

Entropy (Basel, Switzerland)·2026
Same journal

The Statistical-Mechanical Meaning of the Wave Function of Quantum Mechanics.

Entropy (Basel, Switzerland)·2026
See all related articles

Related Experiment Video

Updated: Aug 5, 2025

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
13:44

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Published on: August 30, 2013

43.0K

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.

Entropy (Basel, Switzerland)
|March 29, 2023
PubMed
Summary
This summary is machine-generated.

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.

Keywords:
chosen plaintext attackcryptanalysishyperchaotic mapimage encryption

More Related Videos

Author Spotlight: Unveiling the Potential of VSFG Microscopy in Studying Mesoscopically Heterogeneous Self-Assembled Structures
08:49

Author Spotlight: Unveiling the Potential of VSFG Microscopy in Studying Mesoscopically Heterogeneous Self-Assembled Structures

Published on: December 1, 2023

1.5K
Digital Inline Holographic Microscopy DIHM of Weakly-scattering Subjects
10:16

Digital Inline Holographic Microscopy DIHM of Weakly-scattering Subjects

Published on: February 8, 2014

12.3K

Related Experiment Videos

Last Updated: Aug 5, 2025

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns
13:44

Detection of Architectural Distortion in Prior Mammograms via Analysis of Oriented Patterns

Published on: August 30, 2013

43.0K
Author Spotlight: Unveiling the Potential of VSFG Microscopy in Studying Mesoscopically Heterogeneous Self-Assembled Structures
08:49

Author Spotlight: Unveiling the Potential of VSFG Microscopy in Studying Mesoscopically Heterogeneous Self-Assembled Structures

Published on: December 1, 2023

1.5K
Digital Inline Holographic Microscopy DIHM of Weakly-scattering Subjects
10:16

Digital Inline Holographic Microscopy DIHM of Weakly-scattering Subjects

Published on: February 8, 2014

12.3K

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.