Title: Comprehensive study on digital image encryption using magic square

Authors: Vybhavi Balasundar; K. Mani; Uma Devi; S. Kumar Chandar

Addresses: Department of Computer Science, Nehru Memorial College (Autonomous), Puthanampatti, Tiruchirappalli District, Tamil Nadu-621007, India; Affiliated to: Bharathidasan University, Tiruchirappalli-620024, India ' Department of Computer Science, Nehru Memorial College (Autonomous), Puthanampatti, Tiruchirappalli District, Tamil Nadu-621007, India; Affiliated to: Bharathidasan University, Tiruchirappalli-620024, India ' Department of Computer Science, Nehru Memorial College (Autonomous), Puthanampatti, Tiruchirappalli District, Tamil Nadu-621007, India; Affiliated to: Bharathidasan University, Tiruchirappalli-620024, India ' Department of Computer Science, Christ University, Hosur Bangalore, India

Abstract: Digital image encryption plays a vital role in safeguarding sensitive images from unauthorised access. Among the emerging methodologies, magic square-based encryption has gained significant attention due to its simplicity, flexibility, and capacity to generate diverse encryption keys. This review provides a detailed analysis of magic square-based techniques for image encryption, emphasising their unique properties and applications. The paper examines several recent algorithms, exploring their design, strengths, and limitations. Furthermore, it highlights the potential of hybrid encryption approaches that integrate magic square techniques with other cryptographic methods to enhance security and efficiency. Finally, the review discusses the current advancements in magic square-based image encryption and identifies key challenges, such as scalability, robustness, and adaptability, clearing the path for additional study and advancement in this area.

Keywords: digital image encryption; magic square methodology; hybrid encryption; algorithms; techniques.

DOI: 10.1504/IJRIS.2026.155210

International Journal of Reasoning-based Intelligent Systems, 2026 Vol.18 No.4, pp.243 - 248

Received: 18 Oct 2024
Accepted: 06 Mar 2025
Published online: 29 Jul 2026 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article