Autor: |
Joshi, Anand B., Kumar, Dhanesh, Kumar, Sachin, Singh, Sonali |
Zdroj: |
Multimedia Tools & Applications; Jan2024, Vol. 83 Issue 3, p6803-6828, 26p |
Abstrakt: |
This paper proposes a new technique for image data security using the concepts from graph theory. The proposed technique considers the pixels of the digital image as vertices of a graph and defines edges between vertices with some real weight to each edge. Using the minimal spanning tree (MST) and weighted adjacency matrix of MST, the encryption and decryption algorithm for the color digital image are proposed. The experimental results and the security analysis of the proposed technique are given to validate the feasibility and robustness of the proposed method. Statistical analysis like histogram, correlation, and entropy confirm the robustness of the proposed method against statistical attacks. The experimental results also show that the proposed technique is resistant to brute force and occlusion attacks. [ABSTRACT FROM AUTHOR] |
Databáze: |
Complementary Index |
Externí odkaz: |
|