article · IEEE Access
A three-stage image encryption framework has been developed using a fractional-order hyperchaotic Chen system. In the initial stage, the discrete Fourier transform of the system's numerical solution is calculated, quantised, and used to perform DNA coding. The second stage applies a robust substitution box derived from this quantised solution. The third stage uses a Mersenne Twister key converted to a variable base alongside a modulo operation. The algorithm achieves an encryption rate of 72.6 megabits per second and an expansive key space of two to the power of 1754. Testing demonstrates high security metrics, including an information entropy of 7.999, correlation coefficients of zero, and successful completion of all NIST SP 800 evaluations. Overall, the approach provides robust and efficient performance alongside standard benchmarks.
Protecting digital images from unauthorised interception requires algorithms that are both exceptionally hard to crack and fast enough for practical transmission. By generating highly unpredictable chaotic sequences and testing them against strict international security benchmarks, this research offers a method to secure sensitive visual data without sacrificing processing throughput.
This technology is relevant to software developers and telecommunication providers requiring secure visual data transmission. Evaluated experimentally with an encryption throughput of 72.6 megabits per second, the technique represents applied algorithmic research. While the system satisfies standard NIST cryptographic validation, the abstract does not indicate physical hardware deployment or integration into commercial communication networks.
AI-generated from the published abstract. Always read the original work before citing.
This research work extends the hyperchaotic 4D Chen system into the fractional-order domain to carry out image encryption over 3 stages. For the first encryption stage, the discrete Fourier transform (DFT) of the numerical solution of the fractional-order Chen system is obtained, quantized, and employed in carrying out DNA coding. For the second stage, a robust S-box is constructed from the DFT-quantized solution of the Chen system and applied. For the third stage, a Mersenne Twister encryption key is converted to base-ϕ, and a modulo operation is applied. The proposed technique is shown to be efficient, secure, and robust, performing comparably to its counterparts in the literature. Average computed values include an MSE of 9610, a PSNR of 8.33 dB, an MAE of 80.22, an information entropy of 7.999, correlation coefficients of zero, an NPCR of 99.62%, and a UACI of 31.46%. It also passes all the NIST SP 800 suite of tests. The main advantages of the proposed technique are its superior key space of 2 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">1754</sup> and encryption rate of 72.6 Mbps.
This page summarises published work. The authoritative version sits with the publisher.
DOI: 10.1109/access.2024.3363018
Is something wrong with this record? Report it or request removal.
Discussion
Have you built on this work, tried to replicate it, or seen it applied in practice? Share what you know. Verified researchers and MARATTO™ domain experts can open a discussion, and any member can reply. Contributions are reviewed before they appear.
No discussion yet. Open the first thread.
New to MARATTO™? Create a free account.
