Novel encryption for color images using fractional-order hyperchaotic system.

Khalid M Hosny1, Sara T Kamal2, Mohamed M Darwish2

  • 1Information Technology Department, Zagazig University, Zagazig, Egypt.

Journal of Ambient Intelligence and Humanized Computing
|January 12, 2022
PubMed
Summary

This article introduces a new method for securing color images using complex mathematical systems known as fractional-order hyperchaotic systems. By combining these systems with a specific matrix-based transformation, the authors create a multi-step process that scrambles pixel locations and alters color values. This approach provides a robust defense against unauthorized access and potential data breaches. The researchers demonstrate that their technique effectively protects image confidentiality while maintaining high performance. This work highlights the advantages of using fractional-order mathematics over traditional integer-based methods for digital security. The findings offer a reliable framework for developing advanced encryption tools in the digital age. Overall, the study provides a practical solution for safeguarding sensitive visual information.

Frequently Asked Questions

Related Concept Videos

¹H NMR: Interpreting Distorted and Overlapping Signals01:02

¹H NMR: Interpreting Distorted and Overlapping Signals

Spin systems where the difference in chemical shifts of the coupled nuclei is greater than ten times J are called first-order spin systems. These nuclei are weakly coupled, and their chemical shifts and coupling constant can generally be estimated from the well-separated signals in the spectrum.
As Δν decreases and the signals move closer, the doublets appear increasingly distorted. The intensities of the inner lines increase at the cost of those of the outer lines as the signals are...
1.1K
Convolution: Math, Graphics, and Discrete Signals01:24

Convolution: Math, Graphics, and Discrete Signals

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...
472
Entropy Change in Reversible Processes01:10

Entropy Change in Reversible Processes

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.8K
Properties of Fourier series II01:21

Properties of Fourier series II

Time scaling of signals is a crucial concept in signal processing that affects the Fourier series representation without altering its coefficients. The process modifies the fundamental frequency, thereby changing how the series represents the signal over time. This principle is essential in various applications, including audio and image processing, where signal manipulation is frequent. Understanding function symmetries is fundamental to simplifying the Fourier series.
A function f(t) is...
298
Hückel's Rule Diagram of π MOs: Frost Circle01:08

Hückel's Rule Diagram of π MOs: Frost Circle

The Frost circle or the inscribed polygon method is a graphical method for determining the relative energies of π molecular orbitals (MOs) for planar, fully conjugated, and monocyclic compounds. This method was first described by A. A. Frost and Boris Musulin in 1953.
A Frost circle is constructed by drawing a polygon whose number of edges is equal to the number of carbons of the given cyclic system, with one of the vertices pointing down. Then, a circle is drawn enclosing the polygon so...
4.9K
Difference Equation Solution using z-Transform01:24

Difference Equation Solution using z-Transform

The z-transform is a powerful tool for analyzing practical discrete-time systems, often represented by linear difference equations. Solving a higher-order difference equation requires knowledge of the input signal and the initial conditions up to one term less than the order of the equation.
The z-transform facilitates handling delayed signals by shifting the signal in the z-domain, which corresponds to delaying the signal in the time domain, and advancing signals by similarly shifting in the...
399