Open AccessA combination of least significant bit and deflate compression for image steganography
Author(s) -
Huda Kadhim Tayyeh,
Ahmed Sabah Ahmed AL-Jumaili
Publication year - 2022
Publication title -
international journal of power electronics and drive systems/international journal of electrical and computer engineering
Language(s) - English
Resource type - Journals
eISSN - 2722-2578
pISSN - 2722-256X
DOI - 10.11591/ijece.v12i1.pp358-364
Subject(s) - least significant bit , steganography , computer science , huffman coding , encryption , embedding , steganography tools , cryptography , artificial intelligence , pixel , image (mathematics) , computer vision , cover (algebra) , coding (social sciences) , theoretical computer science , data compression , algorithm , mathematics , computer security , statistics , mechanical engineering , engineering , operating system
Steganography is one of the cryptography techniques where secret information can be hidden through multimedia files such as images and videos. Steganography can offer a way of exchanging secret and encrypted information in an untypical mechanism where communicating parties can only interpret the secret message. The literature has shown a great interest in the least significant bit (LSB) technique which aims at embedding the secret message bits into the most insignificant bits of the image pixels. Although LSB showed a stable performance of image steganography yet, many works should be done on the message part. This paper aims to propose a combination of LSB and Deflate compression algorithm for image steganography. The proposed Deflate algorithm utilized both LZ77 and Huffman coding. After compressing the message text, LSB has been applied to embed the text within the cover image. Using benchmark images, the proposed method demonstrated an outperformance over the state of the art. This can proof the efficacy of using Deflate as a data compression prior to the LSB embedding.