Irregular Reflexive Labeling and Elementary Row Operations for Enhanced Biometric Image Encryption
- 1 PUI-PT Combinatorics and Graph, CGANT-University of Jember, Indonesia
- 2 Department of Mathematics, Faculty of Mathematics and Natural Sciences, University of Jember, Indonesia
- 3 Department of Mathematics Education, Faculty of Teacher Training and Education, Universitas PGRI Argopuro Jember, Indonesia
Abstract
A total k-labeling defined the function fe: E(G) → {1, 2, …, ke} and fv: V(G) → {0, 2, …, 2kv}, where, k = max {ke, 2kv}. For graph G, the total k-labeling is called an edge (or a vertex) irregular reflexive k-labeling if the condition of every two different edges (or vertices) has different weights. The smallest value of k for which such labeling exists is called the reflexive edge strength (or reflexive vertex strength) of the graph G, denoted by res (G) (or rvs(G)). This research objective is developing edge irregular reflexive k-labeling and combining edge and vertex irregular reflexive k-labeling and row element operation as an innovative approach to constructing a robust keystream for biometric image encryption. The results show that the best keystream is generated by Cn⊙P2 and the complete graph. Our results can also surpass existing encryption algorithms such as AES and DES.
DOI: https://doi.org/10.3844/jcssp.2024.1766.1777
Copyright: © 2024 Ika Hesti Agustin, Dafik, Rifki Ilham Baihaki, Marsidi and Kiswara Agung Santoso. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.
- 270 Views
- 143 Downloads
- 0 Citations
Download
Keywords
- Biometrics Image
- Image Encryption
- Irregular Reflexive k-Labeling
- Elementary Row Operation