Keamanan Data Berbasis Representasi Dimensi Partisi Graf Siklus
DOI:
10.29303/jm.v8i3.13612Published:
2026-09-30Downloads
Abstract
This study develops and evaluates the PDE-SEC (Partition Dimension--Security) prototype for securing .tex files using vertex representation codes on the cycle graph C256. Each byte value is mapped to a graph vertex and represented using a three-class resolving partition. The representation codes are incorporated into a key-dependent permutation, followed by a SHA-256-based keystream transformation and HMAC-SHA-256 for integrity verification. Experiments were conducted on 15 .tex files using correctness, file size, overhead, encryption and decryption time, throughput, entropy, correlation, avalanche effect, and key sensitivity. All 15 files were successfully recovered. The cumulative original size of 481,582 bytes became 483,502 bytes after encryption, corresponding to 0.3987% aggregate overhead. Total encryption and decryption times were 0.457746 s and 0.752114 s, with aggregate throughputs of 1.0521 MB/s and 0.6403 MB/s, respectively. Mean ciphertext entropy was 7.9815 bit/byte, mean absolute correlation was 0.00739, and recorded key sensitivity was 50.0238%. The initial avalanche result cannot yet be treated as a final measure because the paired tests used different nonces. Overall, PDE-SEC successfully transformed and recovered the tested files with low size overhead and ciphertext statistics close to a uniform distribution; controlled avalanche testing with the same nonce is still required before stronger security conclusions can be drawn.
Keywords:
partition dimension vertex representation code cycle graph data security encryptionReferences
Ali, N. A., Sadiqa, A., Shahzad, M. A., Qureshi, M. I., Siddiqui, H. M. A., Abdallah, S. A. O. O., & Abd El-Gawaad, N. S. (2024). Secure communication in the digital age: A new paradigm with graph-based encryption algorithms. Frontiers in Computer Science, 6, 1454094. https://doi.org/10.3389/fcomp.2024.1454094
Amrullah, A., Hayati, L., & Junaidi, J. (2025). Partition dimension of bridge graphs between complete and star graphs. International Journal of Computing Science and Applied Mathematics, 11(2), 48–52. https://doi.org/10.12962/j24775401.ijcsam.v11i2.8363
Baskoro, E. T., & Haryeni, D. O. (2020). All graphs of order n ≥ 11 and diameter 2 with partition dimension n − 3. Heliyon, 6(4), e03694. https://doi.org/10.1016/j.heliyon.2020.e03694
Chartrand, G., Salehi, E., & Zhang, P. (2000). The partition dimension of a graph. Aequationes Mathematicae, 59, 45–54.
Daming, A. S., & Yuliani. (2024). Dimensi partisi graf hasil amalgamasi sisi graf roda dengan graf bintang. Euler: Jurnal Ilmiah Matematika, Sains dan Teknologi, 12(2).
Fakhira, L. A., Hadi, N. W., Asmiati, A., & Nurvazly, D. E. (2025). The partition dimension of origami graphs and its barbell. Indonesian Journal of Combinatorics, 9(2). https://doi.org/10.19184/ijc.2025.9.2.4
Hasibuan, I. M., & Abidin, W. (2025). On the partition dimension of a subdivision of complete graph and complete bipartite graph. Jurnal Matematika UNAND, 14(3), 216–224. https://doi.org/10.25077/jmua.14.3.216-224.2025
Hasmawati, H., Hinding, N., Nurwahyu, B., Daming, A. S., & Amir, A. K. (2022). The partition dimension of the vertex amalgamation of some cycles. Heliyon, 8(6), e09596. https://doi.org/10.1016/j.heliyon.2022.e09596
Haryeni, D. O., Baskoro, E. T., & Saputro, S. W. (2024). Family of graphs with partition dimension three. Indonesian Journal of Combinatorics, 8(2), 64–75. https://doi.org/10.19184/ijc.2024.8.2.1
Koam, A. N. A., Ahmad, A., Alatawi, M. S., Khalil, A., Azeem, M., & Alsinai, A. (2024). On the constant partition dimension of some generalized families of Toeplitz graph. Journal of Mathematics, 2024, 4721104. https://doi.org/10.1155/2024/4721104
Luo, R., Khalil, A., Ahmad, A., Azeem, M., Ibragimov, G., & Nadeem, M. F. (2022). Computing the partition dimension of certain families of Toeplitz graph. Frontiers in Computational Neuroscience, 16, 959105. https://doi.org/10.3389/fncom.2022.959105
Ni, B., Qazi, R., Rehman, S. U., & Farid, G. (2021). Some graph-based encryption schemes. Journal of Mathematics, 2021, 6614172. https://doi.org/10.1155/2021/6614172
Abdel-Kader, R. F., et al. (2024). Image encryption algorithms: A survey of design and evaluation metrics. Journal of Cybersecurity and Privacy, 4(1), 126–152. https://doi.org/10.3390/jcp4010007
Design and optimization of nonlinear component of block cipher: Applications to multimedia security. (2024). Ain Shams Engineering Journal, 15(3), 102507. https://doi.org/10.1016/j.asej.2023.102507
Lightweight image encryption using a novel chaotic technique for the safe Internet of Things. (2024). International Journal of Computational Intelligence Systems. https://doi.org/10.1007/s44196-024-00535-3
Sine-Polynomial Chaotic Map (SPCM): A decent cryptographic solution for image encryption in wireless sensor networks. (2025). International Journal of Computational Intelligence Systems.
Enhanced lightweight and compromised-resilient image encryption for resource constrained environments. (2025). PLOS ONE. https://doi.org/10.1371/journal.pone.0320046
National Institute of Standards and Technology. (2000). Report on the development of the Advanced Encryption Standard (AES) (NISTIR 6390). U.S. Department of Commerce.
National Institute of Standards and Technology. (2019). Recommendation for block cipher modes of operation: Galois/Counter Mode (GCM) and GMAC (NIST SP 800-38D). U.S. Department of Commerce.
Nir, Y., & Langley, A. (2018). ChaCha20 and Poly1305 for IETF protocols (RFC 8439). Internet Engineering Task Force. https://doi.org/10.17487/RFC8439
Krawczyk, H., Bellare, M., & Canetti, R. (1997). HMAC: Keyed-hashing for message authentication (RFC 2104). Internet Engineering Task Force. https://doi.org/10.17487/RFC2104
License
Copyright (c) 2026 Amrullah Amrullah, Junaidi Junaidi, Ratna Yulis Tyaningsih, Nilza Humaira Salsabilla, M. Gunawan Supiarmo, Meiliza E.R.
This work is licensed under a Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International License.
