![]() ![]() ![]() However, both methods have the same goal, namely the attempt to conceal the message. In a secret message, cryptography is more directed to the encrypted message while steganography is more directed at the hidden message. This enhances the security and also does not increase the time of execution by a large margin. So 2nd character of the message is multiplied with 2, third character with 3 and so on. For any character in the ‘x’ position the key is simply first multiplied with ‘x’ and then mod is done to obtain the encrypted character. Once a private shared key is obtained by making use of the Diffie-Hellman method, the key is subject to the mod operation with 26 to obtain a value less than or equal to 26, then the current character is taken and to this the key value obtained is added to obtain a new character. This paper proposes an enhancement to the existing algorithm by making use first of a simple Diffie-Hellman key exchange scenario to obtain a secret key and later using simple mathematics to ensure the encryption of data is much more safer. To improve the algorithm and enhance it's security feature, a few changes can be added. This is because in this algorithm each character of a message is always replaced by the same fixed character that has been predetermined. However the algorithm is extremely easy to crack. Now much newer algorithms have arrived that are much more secure, however in terms of speed of execution Caesar cipher algorithm is still the fastest owing to its simplicity. The Caesar Cipher algorithm for cryptography is one of the oldest algorithms. At the instance of inputting a key, it is subjected to modular arithmetic operation with 26 to get a value less or equal to 26, hence transforming the plaintext to a cipher text written into the encrypt.txt file while the decrypted cipher text is written into the decrypt.txt file. In this work, a cryptanalysis of the encryption algorithm using the encryption formula CipherText = PlainText + (Key mod 26) that generates the cipher text and the decryption algorithm using the decrypting formula PlainText = CipherText-(Key mod 26) that returns the cipher text to the original plaintext for the Caesar's cipher was implemented using file operations in the C programming language. The process of decrypting data known as cryptanalysis proves to be a herculean task if the symmetric key (Caesar's shift) is not known by the cryptanalyst. In order to secure data to be transmitted from source to a particular destination there is need for encrypting the data at source and the decrypting of the encrypted data only made possible at the designated destination. Cryptography or message coding techniques are fundamental data security tools. ![]() One of the oldest algorithms for symmetric key cryptography is the Caesar's cipher. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |