Complex Cipher Texts from Complete Graphs including by using Sanskrit in Cryptology

This paper presents Complete Graph Kn(n vertices) and Complete Bipartite Graph Km,n(m and n vertices in the left and right partite sets respectively) allowing longer Plain Texts and creating complex Cipher Texts. This enhances the hiding capacities in the Cryptology applications. These graphs used are labelled with antimagic graph labelling scheme for illustration. Application using Sanskrit Varnamala (Sanskrit alphabets) for still more cryptic Cipher Texts is also presented. These results can be extended and applied to other graphs with suitable modifications where applicable and for other graph labelling schemes also. Encryption and Decryption algorithms are presented for all these applications.