Cryptographic protocols based on graph isomorphism hardness
Journal of Discrete Mathematical Sciences and Cryptography · 31.10.2026 · 29 (10-A) · 4021-4032
DOI: 10.47974/jdmsc-3028 ↗Kurz gefasst
Fachartikel in der Zeitschrift Journal of Discrete Mathematical Sciences and Cryptography, online erschienen am 31.10.2026. Verfasst von Prabhat Sharma und 5 weiteren Autor:innen.
Abstract (Originalsprache)
Kein Abstract verfügbar.
Zitieren
APA
Sharma, P., Mani, M., Zade, M., Bhavani, I., Snehaa, R., & Rohini, K. (2026). Cryptographic protocols based on graph isomorphism hardness. Journal of Discrete Mathematical Sciences and Cryptography, 29(10-A), 4021-4032. https://doi.org/10.47974/jdmsc-3028
Vancouver
Sharma P, Mani M, Zade M, Bhavani I, Snehaa R, Rohini K. Cryptographic protocols based on graph isomorphism hardness. Journal of Discrete Mathematical Sciences and Cryptography. 2026;29(10-A):4021-4032. doi:10.47974/jdmsc-3028
BibTeX
@article{Sharma2026,
author = {Sharma, Prabhat and Mani, M. and Zade, Mahesh and Bhavani, I. and Snehaa, R. and Rohini, Kasturi},
title = {Cryptographic protocols based on graph isomorphism hardness},
journal = {Journal of Discrete Mathematical Sciences and Cryptography},
year = {2026},
volume = {29},
number = {10-A},
pages = {4021--4032},
doi = {10.47974/jdmsc-3028}
}
EUVIMED