Cryptography System Based on SEMT Labeling of Total Path and Its Application for Securing Image File by Using Android Studio

Trisha Magdalena Adelheid Januaviani, Bahrirrudin Bahrirrudin, Nikita Nikita, I Wayan Sudarsana, Nasria Nacong, Agusman Sahari, Hajar Hajar, Selvy Musdaifah, Moh Ali Akbar, Tri Prasetia Ningrum

Abstract


Cryptography is one of the mathematical techniques used to address information security issues. The study of information security is essential due to the rapid development of information technology, which increases the risk of unauthorized access to sensitive data. Android smartphones are among the most popular communication devices, offering various features such as text messaging, image sharing, audio, video, and more. Given people use Android widely, data stored on Android devices is highly vulnerable to hacking attempts. Therefore, a cryptographic approach based on graph labeling will be applied to secure images on Android smartphones. This method utilizes the Super Edge Magic Total (SEMT) labeling for total path graphs to encrypt and decrypt image pixels, ensuring the security of images. Furthermore, this technique will be implemented to develop an Android-based application using Android Studio. The study results indicate that total path graphs satisfy the SEMT labeling properties and the developed application functions effectively on Android devices to secure images.

Keywords


Android; Cryptography; SEMT Labelling; Total Path

References


A. Abdul Aziz and A. B. Bawamohiddin, “The Development of Mobile Application Security Through Encryption,” Journal of Technology and Humanities, vol. 3, no. 2, pp. 26–36, Dec. 2022, doi: 10.53797/jthkkss.v3i2.5.2022.

H. Anwar, “Mathematical Sciences and Applications Algorithm of Encryption Using Graph Theory,” vol. 2, no. 2, 2023.

I. W. Sudarsana, S. A. Suryanto, D. Lusianti, and N. P. A. P. S. Putri, “An application of super mean and magic graphs labeling on cryptography system,” J. Phys. Conf. Ser., vol. 1763, no. 1, p. 012052, Jan. 2021, doi: 10.1088/1742-6596/1763/1/012052.

D. K. Gurjar and A. Krishnaa, “Complete Graph and Hamiltonian Cycle in Encryption and Decryption,” International Journal of Mathematics Trends and Technology, vol. 67, no. 12, pp. 62–71, Dec. 2021, doi: 10.14445/22315373/ijmtt-v67i12p507.

D. Kumar Gurjar and A. Krishnaa, “Various Antimagic Labeled Graphs from Graph Theory for Cryptography Applications,” International Journal of Scientific Research in ___________________________ Research Paper. Mathematical and Statistical Sciences, vol. 9, no. 3, pp. 11–18, 2022, doi: 10.26438/ijsrmss/v9i3.1118.

P. Bagane et al., “International Journal of INTELLIGENT SYSTEMS AND APPLICATIONS IN ENGINEERING Securing Data in Images Using Cryptography and Steganography Algorithms,” 2024. [Online]. Available: www.ijisae.org

G. Xin, X. Xu, C. Zhang, and Y. Zhong, “On magic distinct labellings of simple graphs,” J. Symb. Comput., vol. 119, pp. 22–37, Nov. 2023, doi: 10.1016/J.JSC.2023.02.005.

M. Ahmad, V. Costamagna, B. Crispo, F. Bergadano, and Y. Zhauniarovich, “StaDART: Addressing the problem of dynamic code updates in the security analysis of android applications,” Journal of Systems and Software, vol. 159, p. 110386, Jan. 2020, doi: 10.1016/J.JSS.2019.07.088.

A. M. Qadir and N. Varol, “A review paper on cryptography,” in 7th International Symposium on Digital Forensics and Security, ISDFS 2019, Institute of Electrical and Electronics Engineers Inc., Jun. 2019. doi: 10.1109/ISDFS.2019.8757514.

A. Kareem Ridha, R. S. Jabar, and I. H. ALQinani, “Subject Review:Encryptionof Image in the Android Environment in Various Algorithms,” International Journal of Engineering Research and Advanced Technology, vol. 07, no. 06, pp. 22–26, 2021, doi: 10.31695/ijerat.2021.3715.

A. Ometov, K. Zeman, P. Masek, L. Balazevic, and M. Komarov, “A Comprehensive and Reproducible Comparison of Cryptographic Primitives Execution on Android Devices,” IEEE Access, vol. 9, pp. 54625–54638, 2021, doi: 10.1109/ACCESS.2021.3069627.

A. Ibrahim Hamid and W. Mustafa Abduallah, “StyleGAN2-Stego: Secure Coverless Image Steganography via Latent Space Encoding,” East Journal of Computer Science, vol. 1, no. 4, Aug. 2025, doi: 10.63496/ejcs.vol1.iss4.188.

M. Sindhu and S. Chandra Kumar, “E-SUPER EDGE MAGIC LABELING ON SOME CLASSES OF GRAPHS.”

A. S. Llado, T. Nakamigawa, and G. Ringel, “SUPER EDGE-MAGIC GRAPHS,” 1998.

K. Rozman and P. Šparl, “Distance magic labelings of Cartesian products of cycles,” Discrete Math., vol. 347, no. 10, p. 114125, Oct. 2024, doi: 10.1016/J.DISC.2024.114125.

D. Froncek, P. Paananen, and L. Sorensen, “Group-supermagic labeling of Cartesian products of two even cycles,” Discrete Math., vol. 347, no. 8, p. 113741, Aug. 2024, doi: 10.1016/J.DISC.2023.113741.

D. McQuillan and J. M. McQuillan, “Strong vertex-magic and super edge-magic total labelings of the disjoint union of a cycle with 3-cycles,” Discrete Math., vol. 346, no. 9, p. 113482, Sep. 2023, doi: 10.1016/J.DISC.2023.113482.

X. Zhang, S. Zhang, C. Ye, and B. Yao, “Graphic lattices made by graph felicitous-type labelings and colorings of topological coding,” Discrete Appl. Math. (1979)., vol. 336, pp. 37–46, Sep. 2023, doi: 10.1016/J.DAM.2023.03.023.




DOI: http://dx.doi.org/10.38101/sisfotek.v16i2.15934

Refbacks

  • There are currently no refbacks.


 

JURNAL SISFOTEK GLOBAL

Organized by: Research Center and Community Development
Published by: Institut Teknologi dan Bisnis Bina Sarana Global
Jl. Aria Santika No.43A, Margasari, Kec. Karawaci, Kota Tangerang, Banten 15114
Phone. +62 552 2727
Email: lppm@global.ac.id

INDEXED BY:

   


Creative Commons License
This work is licensed under a Creative Commons Attribution 4.0 International License..
Based on a work at https://journal.global.ac.id/index.php/sisfotek/index.