Data encryption is the mechanism by which the message is changed to take a form that cannot be read by an unauthorized user, called ciphertext . Only the user with a secret key can access the text message. The message before being sent without encryption is called plain text. There are two message encryption mechanisms: Symmetric encryption, in which the same secret key called the private key is applied to encrypt the data by the sender and decrypt the data by the recipient. The secret key is common to the sender and the recipient. Asymmetric encryption uses two keys; private and public for encryption and decryption. Say no to plagiarism. Get a tailor-made essay on “Why Violent Video Games Should Not Be Banned”? Get the Original Essay The mechanism of data encryption is to protect information from threats when it is stored on computers and transmitted over the Internet or other computer networks. The following mechanism is used to change the text to colors at the sender side: ASCII-based encoding mechanism using colorThe ASCII-based encoding mechanism method using colors is used by. In the RGB 256 color style, a pixel is represented by 24 bits, in which 8 bits represent the intensity of each color. For example, the color (100, 125, 140) is represented by (01100100 01111101 10001100) and implemented by. By choosing the first eight bits i.e. 01100100: and ignoring the most significant bit, the remaining 7 bits or the first 128 parts of the color are used to represent a character in the ASCII table. Likewise, three different characters can be denoted by a single color. Thus, a text document is converted into an encoded file filled with colored dots. Using the above encoding technique, a huge amount of text can be compressed and transmitted more securely. The concept of ASCII based coding method to represent characters and change them into colors is used in the proposed study. Lossless Text Compression The text compression mechanism requires that the combination of compression and decompression mechanisms be lossless, otherwise the data cannot be restored to its true format. The text substitution data compression method is referred to as. The scheme of data compression mechanisms includes adjustments between various factors, such as the degree of compression, the amount of distortion introduced; whether you are using a lossy compression algorithm and the computational resources required to compress and decompress the data. The mechanism given below is used for lossless text compression in source-end color-coded encryption implemented by Huffman: Huffman Coding Compression Algorithm. The Huffman coding algorithm is an optimal compression algorithm in which the occurrence of each letter or symbol is used to compress the data. . The idea behind the algorithm is that if some letters are more frequent than others, it makes sense to use fewer bits to encode those letters than to encode the less repeated letters. 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 frequently 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.