Open Access
Research Article·pp. 4021–4032·Vol. 29, Issue 10-AOct 2026
Cryptographic protocols based on graph isomorphism hardness
Prabhat Sharma, M. Radhika Mani, Mahesh M. Zade, I. Durga Bhavani, R. Snehaa, Kasturi Rohini
Published Online: 31 Oct 2026DOI: 10.47974/JDMSC-3028
In this paper: Graph isomorphism (GI) has turned out to be an attractive basis of the construction of secure cryptographic protocols because it has a special set of computational hardness properties, not in the clas...
