Secure communication via c-exponential mean-labeled graphs : A novel message encryption scheme
Journal of Discrete Mathematical Sciences & Cryptography · 2026 · 29 (6) · 2393-2408
DOI: 10.47974/jdmsc-2653 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Discrete Mathematical Sciences & Cryptography, 2026. Verfasst von K. V. Madhumitha und 4 weiteren Autor:innen.
Abstract (Originalsprache)
Cryptography plays an important role in transferring information safely in the computerized world. It consists of two parts; one is encryption of the message so that the cipher text will not reveal the original message to anyone. The other part is decryption at the receiver’s side which reverses the encryption process and restores the original message. There is numerous encryption algorithm to secure the information. Graph labeling is one of the tools to encrypt a message. This paper proposes a new encryption technique to encode and decode the message very securely using C-exponential mean graph labeling by considering various graphs.
Zitieren
APA
Madhumitha, K. V., Rao, A., Prabhu, T. P., Nayak, S., & D’Souza, S. (2026). Secure communication via c-exponential mean-labeled graphs : A novel message encryption scheme. Journal of Discrete Mathematical Sciences & Cryptography, 29(6), 2393-2408. https://doi.org/10.47974/jdmsc-2653
Vancouver
Madhumitha KV, Rao A, Prabhu TP, Nayak S, D’Souza S. Secure communication via c-exponential mean-labeled graphs : A novel message encryption scheme. Journal of Discrete Mathematical Sciences & Cryptography. 2026;29(6):2393-2408. doi:10.47974/jdmsc-2653
BibTeX
@article{Madhumitha2026,
author = {Madhumitha, K. V. and Rao, Anuradha and Prabhu, T. Prajwal and Nayak, Swati and D’Souza, Sabitha},
title = {Secure communication via c-exponential mean-labeled graphs : A novel message encryption scheme},
journal = {Journal of Discrete Mathematical Sciences & Cryptography},
year = {2026},
volume = {29},
number = {6},
pages = {2393--2408},
doi = {10.47974/jdmsc-2653}
}
EUVIMED