Generating strong keys using modified Huffman tree approach
S. Prasanna Venkatesan, S. R. Srividhya, Nooka Saikumar, G. Manikandan · 2016
Cryptography is a technique by which the stored and transferred data in a particular form can be comprehended and processed by only those, who it is intended for. In the modern era, cryptography is most often associated with the deception of the plaintext into a cipher text using a process called Encryption then back to the original plaintext using a process called Decryption. Strong cryptography refers to those cryptographic systems or components that provide considerable immunity to cryptanalysis. The potency of any cryptographic algorithm is solely dependent on the strength of the key used. This paper aims at improving the strength of the key by making use of modified Huffman Code which is a special kind of prefix code which is optimal in nature and is prevalently used for lossless data compression. The outcome of Huffman code is a code of variable length which can be effectively used encoding a source character. The aforementioned concept makes use of the Blowfish algorithm for encryption and is implemented using Java.