Square-Based Division Scheme for Image Encryption Using Generalized Fibonacci Matrices
Panagiotis Oikonomou,
George K. Kranas,
Maria Sapounaki,
Georgios Spathoulas (),
Aikaterini Aretaki,
Athanasios Kakarountas and
Maria Adam
Additional contact information
Panagiotis Oikonomou: Department of Computer Science & Telecommunications, University of Thessaly, 35100 Lamia, Greece
George K. Kranas: Department of Computer Science & Biomedical Informatics, University of Thessaly, 35131 Lamia, Greece
Maria Sapounaki: Department of Computer Science & Biomedical Informatics, University of Thessaly, 35131 Lamia, Greece
Georgios Spathoulas: Department of Computer Science & Biomedical Informatics, University of Thessaly, 35131 Lamia, Greece
Aikaterini Aretaki: Department of Computer Science & Biomedical Informatics, University of Thessaly, 35131 Lamia, Greece
Athanasios Kakarountas: Department of Computer Science & Biomedical Informatics, University of Thessaly, 35131 Lamia, Greece
Maria Adam: Department of Computer Science & Biomedical Informatics, University of Thessaly, 35131 Lamia, Greece
Mathematics, 2025, vol. 13, issue 11, 1-31
Abstract:
This paper proposes a novel image encryption and decryption scheme, called Square Block Division-Fibonacci (SBD-Fibonacci), which dynamically partitions any input image into optimally sized square blocks to enable efficient encryption without resizing or distortion. The proposed encryption scheme can dynamically adapt to the image dimensions and ensure compatibility with images of varying and high resolutions, while it serves as a yardstick for any symmetric-key image encryption algorithm. An optimization model, combined with the Lagrange Four-Square theorem, minimizes trivial block sizes, strengthening the encryption structure. Encryption keys are generated using the direct sum of generalized Fibonacci matrices, ensuring key matrix invertibility and strong diffusion properties and security levels. Experimental results on widely-used benchmark images and a comparative analysis against State-of-the-Art encryption algorithms demonstrate that SBD-Fibonacci achieves high entropy, strong resistance to differential and statistical attacks, and efficient runtime performance—even for large images.
Keywords: symmetric key algorithms; encryption; decryption; generalized Fibonacci matrix; security; division scheme (search for similar items in EconPapers)
JEL-codes: C (search for similar items in EconPapers)
Date: 2025
References: Add references at CitEc
Citations:
Downloads: (external link)
https://www.mdpi.com/2227-7390/13/11/1781/pdf (application/pdf)
https://www.mdpi.com/2227-7390/13/11/1781/ (text/html)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:gam:jmathe:v:13:y:2025:i:11:p:1781-:d:1665570
Access Statistics for this article
Mathematics is currently edited by Ms. Emma He
More articles in Mathematics from MDPI
Bibliographic data for series maintained by MDPI Indexing Manager ().