Secure symmetric encryption using coloring of multipartite graphs
Frontiers in Computer Science · 04.11.2026 · 8
DOI: 10.3389/fcomp.2026.1918269 ↗Kurz gefasst
Fachartikel in der Zeitschrift Frontiers in Computer Science, online erschienen am 04.11.2026. Verfasst von D Gomathi und 1 weiteren Autor:innen. Die Arbeit nennt 20 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0).
Abstract (Originalsprache)
Introduction
Lightweight cryptographic schemes are needed for resource-constrained environments such as Internet of Things systems, wireless sensor networks, and embedded platforms. This paper presents a symmetric encryption framework based on the coloring of complete n-partite graphs, in which the keystream is derived from partition sizes and multi-character color labels assigned to graph partitions.
Methods
A cyclic-padding convention extends all color labels to a common length m = max(ℓ 1 , ℓ 2 , …, ℓ n ) before summation, making the keystream period exactly m by construction. Plaintext characters are encoded using ASCII values and encrypted by symbol-wise modular addition over ℤ 127 , giving a repeated-key additive cipher with time complexity O ( L + n · m ) and space complexity O ( L + n · m ), where L is the message length. A formal threat model distinguishes four adversary categories (ciphertext-only, known-plaintext, chosen-plaintext, and active network adversaries) and sets security thresholds in terms of m .
Results
Encryption and decryption time scale linearly with message length. Empirical ciphertext entropy approaches 6.88 bits per symbol at n = 8 partitions. The scheme provides meaningful confidentiality against ciphertext-only adversaries when L ≤ m .
Discussion
The scheme is vulnerable to known-plaintext attacks, a fundamental limitation shared by all repeated-key additive ciphers. It is therefore positioned as a graph-structured, session-bound, repeated-key additive cipher framework, not a replacement for standardized cryptographic primitives. Its low computational cost supports use in lightweight and resource-constrained settings.
Zitieren
APA
Gomathi, D., & Nagarajan, S. (2026). Secure symmetric encryption using coloring of multipartite graphs. Frontiers in Computer Science, 8. https://doi.org/10.3389/fcomp.2026.1918269
Vancouver
Gomathi D, Nagarajan S. Secure symmetric encryption using coloring of multipartite graphs. Frontiers in Computer Science. 2026;8. doi:10.3389/fcomp.2026.1918269
BibTeX
@article{Gomathi2026,
author = {Gomathi, D and Nagarajan, Sivakumar},
title = {Secure symmetric encryption using coloring of multipartite graphs},
journal = {Frontiers in Computer Science},
year = {2026},
volume = {8},
doi = {10.3389/fcomp.2026.1918269}
}
EUVIMED