Vertex Magic Total Labeling of Complete Graphs and their application for Public-Key Cryptosystem
Achieving higher level of security in message transfer over networked environment and the efficiency of a cryptographic algorithm is based on its time taken for encryption/decryption and the way it produces different cipher text from a clear text. The RSA, the widely used public key algorithm and other public key algorithms may not guarantee that the cipher text is fully secured. As an alternative approach to handling ASCII characters in the cryptosystems, a vertex magic total labeling of complete graph is thought of in this paper. It attempts to enhance the efficiency by providing add-on security to the cryptosystem.