अमूर्त

Vertex Magic Total Labeling of Complete Graphs and their application for Public-Key Cryptosystem

Krishnappa H K1, N K Srinath2 and S Manjunath3

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 work. It attempts to enhance the efficiency by providing add-on security to the cryptosystem. This approach will increase the security due to its complexity in encryption because it deals with the VMTL formation that cannot be easily traced. Here, encryption / decryption is based on numerals contained in VMTL table rather than ASCII values. This proposed work provides another layer of security to any public key algorithms such as RSA, ElGamal etc. Since, this model is acting as a wrapper to a public key algorithm; it ensures that the security is enhanced. Further, this approach is experimented in a simulated environment with 2, and 4 processor.