Mahesh M. Zade

Cryptographic protocols based on graph isomorphism hardness

Prabhat Sharma, M. Radhika Mani, Mahesh M. Zade, I. Durga Bhavani, R. Snehaa, Kasturi Rohini

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...