The basic requirement of the text compression mechanism is that the combination of compression and decompression mechanisms should be lossless, otherwise the data cannot be restored to its actual format. The text substitution data compression mechanism is used by [3][6]. The diagram of data compression mechanisms includes changes between various factors, such as the degree of compression, the amount of distortion introduced; for the lossy compression algorithm and the computing resources needed to compress and decompress the data. Say no to plagiarism. Get a tailor-made essay on “Why Violent Video Games Should Not Be Banned”? Get the original essay The mechanism given below is used for lossless text compression in source color-coded encryption employed by Huffman: Huffman Encoding Compression AlgorithmThe Huffman Encoding Algorithm is an algorithm optimal compression in which the occurrence of each letter or symbol is used to compress the data. The plan behind this technique is that if you have certain letters that are more repeated than others, it makes sense to use fewer bits to encode those letters than to encode the less repeated letters [4]. This algorithm builds the ascending tree using the occurrence of each letter or symbol. First, each letter starts as part of its own tree and the trees are ordered based on the occurrence of letters in the actual string. Then the two least repeated used letters are combined into a single tree and the frequency of that tree is set to be the combined frequency of the two trees it connects. This new tree is reinserted into the tree file in its sorted location. The procedure is then repeated, treating trees with more than one component like any other tree, except that their frequencies are the sum of the frequencies of all letters on the leaves. It is simply the sum of the left and right children of any node, because each node stores frequency information on its own children. The procedure ends when all trees have been combined into a single tree. This tree describes Huffman compression coding. Normally the tree is designed from the bottom up: we start with 256 trees and end with a single tree with 256 leaves and 255 internal nodes. The tree has an interesting property: the occurrences of all internal nodes combined jointly will give the total number of bits needed to write the encoded I file. Proposed SystemThis paper proposes a cryptographic encryption and decryption method called color-coded cryptography that uses color compression and Huffman techniques to compress data. It is a symmetric system implemented by encrypting text by converting it into a colored image. Each character in the message is encrypted in color blocks. The reverse process is used to produce the original text from a colored image at the receiver side. Advantages of the proposed system Each character of the plain text is replaced by a color block from the 18 decillion colors available in the world and, at the same time, Receiving, the ciphertext block which is in colored image is decrypted into plain text. It is resistant to issues such as Meet in the middle attacks, Birthday attacks, and brute force attacks [2]. The size of plain text can be reduced when encrypted, without loss. The space occupied by the ciphertext in the buffer is very small; therefore, the transfer of ciphertext through a transmission channel is very fast, which subsequently reduces the transportation cost [2].II. DESIGN AND OPERATION.