Abstract
Our concern in this paper is to explore the possibility of using rough inclusions for image steganography. We present our initial research using indiscernibility relation as a steganographic key for hiding information into the stego carrier by means of a fixed mask. The information can be embedded into the stego-carrier in a semi-random way, whereas the reconstruction is performed in a deterministic way. The information shall be placed in selected bytes, which are indiscernible with the mask to a fixed degree. The bits indiscernible with other ratios (smaller or greater) form random gaps that lead to somehow unpredictable hiding of information presence. We assume that in our technique it can modify bits, the change of which does not cause a visual modification detectable by human sight, so we do not limit ourselves to the least significant bit. The only assumption is that we do not use the position when the mask we define uses it. For simplicity’s sake, in this work we present its operation, features, using the Least Significant Bit (LSB) method. In the experimental part, we have implemented our method in the context of hiding image into the image. The LSB technique in its simplest form is not resistant to stegoanalisys, so we used the well-known LSB matching method to mask the presence of our steganographic key usage. To verify the resistance to stegoanalisys we have conducted and discussed Chi-square and LSB enhancement test. The positive features of our method include its simplicity and speed, to decode a message we need to hide, or pass to another channel, a several-bit mask, degree of indiscernibility and size of the hidden file. We hope that our method will find application in the art of creating steganographic keys.
Highlights
In the introduction we will present two separate parts—discuss the background of the steganographic techniques and start to introduce the key to the surrounding theory
What is attempted to achieve in image steganography is to embed information in such a way that its presence cannot be detected in a stego carrier
The use of rough inclusions and an additional mask to indicate the bytes in which the information is embedded allows the data to be hidden in a semi-random way, which-with evenly distributed in the stego carrier-hides their presence
Summary
In the introduction we will present two separate parts—discuss the background of the steganographic techniques and start to introduce the key to the surrounding theory. Hiding the presence of information in the least significant bit may, for example, consist in searching for the pixels closest to the specific bytes of the message in the image divided into blocks- reducing the number of necessary modifications-see Reference [17]. Another way to secure messages is to embed without creating value pairs, which are detected by Chi Square, for example,-see Reference [18]. To hide the presence of information embedded with our key we used LSB matching technique, using the penultimate bit of colour bytes.
Sign-in/Register to view highlights & summary Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
