FPGA Realization of a Novel Hyperchaos Augmented Image Encryption Algorithm
Open accessAbstract
With the rapid growth of multimedia communication, protecting image data has become increasingly critical. This article proposes a novel 3‐stage hyperchaos‐based augmented image encryption technique (3SHAIET) that utilizes a three‐stage process with chaotic systems of increasing dimensionality (e.g., six‐dimensional [6D], 8D, and 9D) to enhance security against cryptographic attacks. At each stage, the image is converted into a 1D bit‐stream array, encrypted using dynamically generated S‐boxes, and XORed with keys derived from the chaotic systems, ensuring high sensitivity to initial conditions and strong diffusion and confusion properties. To achieve real‐time performance, the algorithm is realized on a field‐programmable gate array (FPGA), leveraging hardware acceleration for the lowest possible latency encryption. The FPGA realization is shown to provide a 165 times improvement in encryption rate over its corresponding software implementation. Experimental results demonstrate the algorithm’s robustness, with an extremely large key space of 2 5475 and resistance to statistical (PSNR of 8.11 dB, MAE of 81.74, and entropy of 7.999) and differential attacks (NPCR of 99.6216% and UACI of 32.0534%). Additionally, the resulting encrypted images’ bit‐streams successfully pass all National Institute of Standards and Technology (NIST) randomness tests, further validating the algorithm’s security. These results make the proposed 3SHAIET algorithm a highly efficient and secure solution for modern multimedia systems. The objective of 3SHAIET is to jointly maximize cryptographic strength (via multistage hyperchaotic keys and dynamic S‐boxes) and real‐time efficiency (via FPGA realization) for secure multimedia transmission and storage.
Integrity signals
Registry
Cites
Statistics
Claims the paper makes
Claims other papers make about this one
Each is checked against this paper’s own text: does it say what the citing paper says it does?
The scheme is suitable for SIMD/GPU acceleration and FPGA implementations in bandwidth-constrained remote-sensing pipelines.
“making the scheme suitable for SIMD/GPU acceleration and FPGA implementations in bandwidth-constrained remote-sensing pipelines22,31,32.”
From Hyperchaotic fractional-order image encryption with Knight’s tour scrambling for satellite imagery (2026) · cites this paper as [32]
Cites
Chaos-Based Image Encryption: Review, Application, and Challenges
Zhang, B., & Liu, L. (2023) · Mathematics · doi:10.3390/math11112585 · Cited by 328 · see citing works
Flagged first, then by citations
Cited by
Sorted by citations
Hyperchaotic fractional-order image encryption with Knight’s tour scrambling for satellite imagery
Mamdouh, E., Aboshousha, A., & Alexan, W. (2026) · Scientific Reports · doi:10.1038/s41598-026-58982-1 · Cited by 3 · see citing works
Self-citation
- Authors
- Alexan, W., Elshabasy, N. H., Mamdouh, E., Osama, R., Abd El Ghany, M. A., & El-Damak, D.
- Affiliations
- German University in Cairo (EG)
- Corresponding author
- Alexan, Wassim
- Venue
- IET Computers & Digital Techniques
- Published
- 2026-01
- Volume
- 2026
- Issue
- 1
- ISSN
- 1751-8601 (ISSN-L)
- 1751-861X
- OpenAlex
- W7130652750
- Cited by
- 6
- References
- 1
- Citations by year
- 2026: 6
- FWCI
- 16.87
- Type
- journal article
- Language
- en
- Open access
- gold
- doi.org
- Licence
- Locations
- IET Computers & Digital Techniques (publishedVersion, cc-by)
- Topics
- Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Chaos-based Image/Signal Encryption
- Physical Sciences › Computer Science › Artificial Intelligence › Computer Science and Engineering
- Physical Sciences › Computer Science › Artificial Intelligence › Cryptographic Implementations and Security
- Keywords
- image encryption, hyperchaos, FPGA acceleration, dynamic S-box, chaotic systems, real-time encryption, differential attack resistance, statistical attack resistance, key space, multimedia security, NIST randomness tests
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review