Data Compression Considering Text Files

Sailunaz, Kashfia; Kotwal, Mohammed Rokibul Alam; Huda, Mohammad Nurul

doi:10.5120/15765-4456

Cited by 6 publications

(4 citation statements)

References 6 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Before embedding, the secret message is represented using the compression technique known as Huffman coding, which results in the secret message having the shortest binary length feasible. The benefit of this method is that it reduces the size of secret messages, increasing payload capacity and security [19].…”

Section: Huffman Algorithmmentioning

confidence: 99%

See 1 more Smart Citation

A Secure and High Capacity Image Steganography Approach Using Huffman Coding and RSA Encryption

Kadhem,

Baawi

2023

J. Al-Qadisiyah Comp. Sci. Math.

View full text Add to dashboard Cite

Steganography is the practice of hiding data, such as images, videos, or text, within a cover image without it being detectable by the human eye. Several factors, such as the capacity, security, and robustness of the technique, are essential when transferring information using this method. In this study, we propose a new approach to image steganography that improves the Least Significant Bit (LSB) technique by utilizing images of 24 bits in each pixel. Improving the capacity and security of LSB-based steganography requires a combination of techniques, such as indirect embedding, embedding in multiple channels, and applying cryptographic and compression techniques. This approach conducts by encrypting each compressed secret message bit with the most significant bit of the red channel and then saving the output bit (hidden bit) in the least significant bit of the (green/blue) channel according to the row value (odd/ even). To further security, the suggested approach uses multi-level encryption; employs RSA to encrypt the secret message before applying the Huffman compression and encrypting the hidden bit by (XOR/XNOR) in the embedding method based on the row value of the pixel. Meanwhile, it is planned to use the Huffman coding technique to shorten the length of the encrypted message that will be inserted in the cover image. For the color photos in this work, the standard images were acquired from a standard dataset (USC-SIPI). The suggested approach performs better when measured in terms of mean square error (MSE), peak signal-to-noise ratio (PSNR), and comparison to findings from related prior efforts.

show abstract

Section: Huffman Algorithmmentioning

confidence: 99%

“…According to the Huffman tree, the two parent nodes had frequencies of 20 and 34, respectively. The frequency of their respective children (8,12) and (15,19) was added to make Figure 1. The high-frequency letter "E" will be made with a great deal of effort.…”

Section: Table 1 -Huffman Codingmentioning

confidence: 99%

A Secure and High Capacity Image Steganography Approach Using Huffman Coding and RSA Encryption

Kadhem,

Baawi

2023

J. Al-Qadisiyah Comp. Sci. Math.

View full text Add to dashboard Cite

show abstract

“…This section explain the result of using DNA compression rate for the amount of time it takes either for encryption or decryption according to the numbers of characters that constitute the message (plain text) as shown in Table 5 compared with research [31].…”

Section: Data Compressionmentioning

confidence: 99%

Data protection based neural cryptography and deoxyribonucleic acid

Kadum

Al-Sultan

Hadie

2022

IJECE

View full text Add to dashboard Cite

The need to a robust and effective methods for secure data transferring makes the more credible. Two disciplines for data encryption presented in this paper: machine learning and deoxyribonucleic acid (DNA) to achieve the above goal and following common goals: prevent unauthorized access and eavesdropper. They used as powerful tool in cryptography. This paper grounded first on a two modified Hebbian neural network (MHNN) as a machine learning tool for message encryption in an unsupervised method. These two modified Hebbian neural nets classified as a: learning neural net (LNN) for generating optimal key ciphering and ciphering neural net CNN) for coding the plaintext using the LNN keys. The second granulation using DNA nucleated to increase data confusion and compression. Exploiting the DNA computing operations to upgrade data transmission security over the open nets. The results approved that the method is effective in protect the transferring data in a secure manner in less time

show abstract

“…In the present study, digital signature strings are inserted in the xref section as in research [7], [8], but before the insertion process is done, digital signature data is compressed first using the huffman algorithm. Compression can compress string size compared to the original data [9], [10], [11], [12]. This data compression process is to minimize the size of the digital signature that will be inserted and produce digital signature data that is not easily perceived.…”

Section: Introductionmentioning

confidence: 99%