Author
Listed:
- Nanfak, Arnaud
- Nkapkop, Jean de Dieu
- Zourmba, Kotadai
- Ngono, Joseph Mvogo
- Moreno-López, Maria Fernanda
- Tlelo-Cuautle, Esteban
- Borda, Monica-Elena
- Effa, Joseph Yves
Abstract
This paper introduces a novel 2D fractional sine-cosine (2D-FSC) hyperchaotic map and its application in a robust image encryption scheme. Through comprehensive dynamic analysis including bifurcation diagrams, Lyapunov exponents, butterfly effect, Shannon entropy, and phase space visualization, it is demonstrated the map's superior chaotic characteristics compared to conventional 1D chaotic systems. The proposed encryption framework employs a three-stage diffusion-permutation-confusion architecture enhanced by two key innovations: (1) a genetic algorithm optimizing diffusion and confusion processes to maximize entropy (7.998 ± 0.002) and minimize correlation coefficients (|cc| < 0.004) of the encrypted image, and (2) a novel chaos-based pixel fusion technique for efficient bit-level permutation. Hardware implementation on a Cyclone IV FPGA (6057 logic elements, 34.29 MHz max frequency) validates the practical feasibility of the chaotic map. Security analysis confirms resistance against brute-force (key space > 2750), statistical (χ² < 184.2), differential (NPCR 99.61 ± 0.04 %, UACI 33.46 ± 0.09 %), and noise/clipping attacks. The algorithm processes 256× 256 images in 0.32 s which is 28–42 % faster than comparable schemes, while maintaining consistent performance across grayscale, color, and edge-case images. These advancements establish a new benchmark for chaos-based cryptosystems in applications requiring both high security and computational efficiency.
Suggested Citation
Nanfak, Arnaud & Nkapkop, Jean de Dieu & Zourmba, Kotadai & Ngono, Joseph Mvogo & Moreno-López, Maria Fernanda & Tlelo-Cuautle, Esteban & Borda, Monica-Elena & Effa, Joseph Yves, 2026.
"Dynamic analysis and FPGA implementation of a 2D fractional sine-cosine map for image encryption using bit-level permutation and genetic algorithm,"
Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 240(C), pages 105-136.
Handle:
RePEc:eee:matcom:v:240:y:2026:i:c:p:105-136
DOI: 10.1016/j.matcom.2025.07.022
Download full text from publisher
As the access to this document is restricted, you may want to
for a different version of it.
Corrections
All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:matcom:v:240:y:2026:i:c:p:105-136. See general information about how to correct material in RePEc.
If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.
We have no bibliographic references for this item. You can help adding them by using this form .
If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.journals.elsevier.com/mathematics-and-computers-in-simulation/ .
Please note that corrections may take a couple of weeks to filter through
the various RePEc services.