In the present work the authors introduced a new symmetric key cryptographic method for encryption as well as decryption of any file such as binary file, text file or any other file. A minor change in the text key will change the cipher text quite a lot. This method supports multiple encryption and multiple decryption. This algorithm was monitored on different plaintexts, and it was found that this method was almost unbreakable. These keys are superimposed on each other and then XOR to the text to produce the cipher text. When a passphrase is taken from the user, a scrambling algorithm is implemented on it, which generates two more random keys. COMCRYPT is an encryption algorithm, which has been formulated on the lines of Vernam cipher.

This is where COMCRYPT comes into picture. In theory, every cryptographic algorithm except the Vernam Cipher can be broken given enough cipher text and time. If a cipher is computationally secure this means the probability of cracking the encryption key using current computational technology and algorithms within a reasonable time is supposedly extremely small, yet not impossible. The worth of all other ciphers is based on computational security. It is called the Vernam cipher or one time pad. Of all the methods of encryption ever devised, only one has been mathematically proved to be completely secure. Security, integrity, non-repudiation, confidentiality and authentication services are the most important factors in information security. In today's information age, information sharing and transfer has increased exponentially.

Vernam encryption algorithm