Comcrypt : An Encryption Algorithm based on
Maulik Kothari, Manthan Shah, Meet Malde, Ashutosh Wad · 2012
In today’s information age, information sharing and transfer has increased exponentially. Security, integrity, non-repudiation, confidentiality and authentication services are the most important factors in information security. Of all the methods of encryption ever devised, only one has been mathematically proved to be completely secure .It is called the Vernam cipher or one time pad. The worth of all other ciphers is based on computational security. 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. In theory, every cryptographic algorithm except the Vernam Cipher can be broken given enough cipher text and time. This is where COMCRYPT comes into picture. COMCRYPT is an encryption algorithm, which has been formulated on the lines of Vernam cipher. When a passphrase is taken from the user, a scrambling algorithm is implemented on it, which generates two more random keys. These keys are superimposed on each other and then XOR to the text to produce the cipher text. This algorithm was monitored on different plaintexts, and it was found that this method was almost unbreakable. This method supports multiple encryption and multiple decryption. A minor change in the text key will change the cipher text quite a lot.