Resumen
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.