Data encryption is the mechanism by which the message is changed into a format that cannot be read by an unauthorized user, known as ciphertext. Only the user with a secret key can access the text message. The message before being sent without encryption is called plaintext. Two message encryption mechanisms are: Symmetric encryption, in which the same secret key known as the private key is applied to encrypt data by the sender and decrypt data by the recipient. The secret key is common for sender and 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 Shouldn't Be Banned"? Get an Original Essay The data encryption mechanism serves to protect information from threats as 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 on the sender side: ASCII-based encoding mechanism using color The ASCII-based encoding mechanism method using colors is used. In the RGB 256 color style, a pixel is represented by 24 bits, of which 8 bits represent the intensity of each color. For example, the color (100, 125, 140) is represented as (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 indicated by a single color. Thus, a text document is converted into an encoded file full of colored dots. Using the encoding technique described above, you can compress and transmit huge amounts of text more securely. In the proposed study, the concept of ASCII-based coding method is used to represent characters and transform them into colors. Lossless text compression The text compression mechanism requires the combination of compression and decompression mechanisms to be lossless, otherwise the data cannot be restored to the actual format. This refers to the method of compressing data by text replacement. The scheme of data compression mechanisms includes adjustments between various factors, such as the degree of compression, the amount of distortion introduced; whether you use a lossy compression algorithm and the computational resources required to compress and decompress the data. The following mechanism is used for lossless text compression in color-coded encryption at the source end implemented by Huffman: Huffman Encoding Compression Algorithm Huffman Encoding Algorithm is an optimal compression algorithm in where 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 rather than encoding the least repeated letters. This algorithm builds the tree from bottom to top using the occurrence of each letter or symbol. First, each letter starts as part of its own tree, and the trees are sorted based on the occurrence of the 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 as the combined frequency of the two trees it links together. This new tree comes.